{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KPUISQTP7VQSFM2BRSM47KVB3W","short_pith_number":"pith:KPUISQTP","schema_version":"1.0","canonical_sha256":"53e889426ffd6122b3418c99cfaaa1ddb7358b5028a762e01f9388188dfb0caa","source":{"kind":"arxiv","id":"1503.04688","version":2},"attestation_state":"computed","paper":{"title":"Simple dynamics on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adrien Richard, Maximilien Gadouleau","submitted_at":"2015-03-16T15:29:46Z","abstract_excerpt":"Does the interaction graph of a finite dynamical system can force this system to have a \"complex\" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system $f:A^n\\to A^n$ with $G$ as interaction graph has a \"complex\" dynamics ? If $|A|\\geq 3$ we prove that no such signed digraph exists. More precisely, we prove that for every signed digraph $G$ there exists a system $f:A^n\\to A^n$ with $G$ as interaction graph that converges toward a unique fixed point in at most $\\lfloor\\log_2 n\\rfloor+2$ steps. The boolean ca"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.04688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-16T15:29:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9b15ebc1afc05e90c54502b7eac1478d9c3617251977f80a5f2ce3ac906f9ebd","abstract_canon_sha256":"66f9b4217ad29da4aaeabfee0f61bb7c17d5bc52df0aafd35494b877c4bbfdfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:30.381183Z","signature_b64":"CKGLF0YIejJJyT8e7AcJBnYCWmDuKwAUtdZclITeTGJQJs8rA5a0f18+pkR/yeSY0jcwCPeKaeCXvwChIdeUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53e889426ffd6122b3418c99cfaaa1ddb7358b5028a762e01f9388188dfb0caa","last_reissued_at":"2026-05-18T01:19:30.380598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:30.380598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple dynamics on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adrien Richard, Maximilien Gadouleau","submitted_at":"2015-03-16T15:29:46Z","abstract_excerpt":"Does the interaction graph of a finite dynamical system can force this system to have a \"complex\" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system $f:A^n\\to A^n$ with $G$ as interaction graph has a \"complex\" dynamics ? If $|A|\\geq 3$ we prove that no such signed digraph exists. More precisely, we prove that for every signed digraph $G$ there exists a system $f:A^n\\to A^n$ with $G$ as interaction graph that converges toward a unique fixed point in at most $\\lfloor\\log_2 n\\rfloor+2$ steps. The boolean ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04688","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.04688","created_at":"2026-05-18T01:19:30.380699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04688v2","created_at":"2026-05-18T01:19:30.380699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04688","created_at":"2026-05-18T01:19:30.380699+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPUISQTP7VQS","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPUISQTP7VQSFM2B","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPUISQTP","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W","json":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W.json","graph_json":"https://pith.science/api/pith-number/KPUISQTP7VQSFM2BRSM47KVB3W/graph.json","events_json":"https://pith.science/api/pith-number/KPUISQTP7VQSFM2BRSM47KVB3W/events.json","paper":"https://pith.science/paper/KPUISQTP"},"agent_actions":{"view_html":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W","download_json":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W.json","view_paper":"https://pith.science/paper/KPUISQTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04688&json=true","fetch_graph":"https://pith.science/api/pith-number/KPUISQTP7VQSFM2BRSM47KVB3W/graph.json","fetch_events":"https://pith.science/api/pith-number/KPUISQTP7VQSFM2BRSM47KVB3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W/action/storage_attestation","attest_author":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W/action/author_attestation","sign_citation":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W/action/citation_signature","submit_replication":"https://pith.science/pith/KPUISQTP7VQSFM2BRSM47KVB3W/action/replication_record"}},"created_at":"2026-05-18T01:19:30.380699+00:00","updated_at":"2026-05-18T01:19:30.380699+00:00"}