{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:65M4LFDEUQXJBL57WAENCGFE77","short_pith_number":"pith:65M4LFDE","canonical_record":{"source":{"id":"1902.08007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-21T12:45:51Z","cross_cats_sorted":["math.CO","math.DS"],"title_canon_sha256":"d5a7f45922362d3bb240ac83375f4781c2a13711ea195bc7cc7b18fdb574124a","abstract_canon_sha256":"a5c9e5ec54587b181d7f0bb90b99aca5a98c3e6b9cb9f2d104cfd0ce1b04eea2"},"schema_version":"1.0"},"canonical_sha256":"f759c59464a42e90afbfb008d118a4ffebbd9a3dc542fa53735ac6dee12565e6","source":{"kind":"arxiv","id":"1902.08007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08007","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08007v1","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08007","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"65M4LFDEUQXJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"65M4LFDEUQXJBL57","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"65M4LFDE","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:65M4LFDEUQXJBL57WAENCGFE77","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-21T12:45:51Z","cross_cats_sorted":["math.CO","math.DS"],"title_canon_sha256":"d5a7f45922362d3bb240ac83375f4781c2a13711ea195bc7cc7b18fdb574124a","abstract_canon_sha256":"a5c9e5ec54587b181d7f0bb90b99aca5a98c3e6b9cb9f2d104cfd0ce1b04eea2"},"schema_version":"1.0"},"canonical_sha256":"f759c59464a42e90afbfb008d118a4ffebbd9a3dc542fa53735ac6dee12565e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:02.443735Z","signature_b64":"UmkjpyZ9ahrYxgRdv+vYWUFjRp/fCJ4yVgkCHM2aYdo1SDqojiQnuC76KLvJAg2iCdPtA4DTbBm3HHvffIMPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f759c59464a42e90afbfb008d118a4ffebbd9a3dc542fa53735ac6dee12565e6","last_reissued_at":"2026-05-17T23:53:02.443041Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:02.443041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08007","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUbht+8eHOKNWZsNjdoCsOdOztRX9S7Mrpa7H6t6R/vDE7Xoo9t0a2Tx/cpbMPrrfPlSX6APuIHEuY4wLgFBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:38:30.530265Z"},"content_sha256":"20eacbffedf5ba372d2421a98d64d8450a8bfe3c37eb33545df8cf69ccfe24a9","schema_version":"1.0","event_id":"sha256:20eacbffedf5ba372d2421a98d64d8450a8bfe3c37eb33545df8cf69ccfe24a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:65M4LFDEUQXJBL57WAENCGFE77","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expansive Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS"],"primary_cat":"cs.DC","authors_text":"Florian Bridoux, Guillaume Theyssier, Maximilien Gadouleau","submitted_at":"2019-02-21T12:45:51Z","abstract_excerpt":"An Automata Network is a map ${f:Q^n\\rightarrow Q^n}$ where $Q$ is a finite alphabet. It can be viewed as a network of $n$ entities, each holding a state from $Q$, and evolving according to a deterministic synchronous update rule in such a way that each entity only depends on its neighbors in the network's graph, called interaction graph. A major trend in automata network theory is to understand how the interaction graph affects dynamical properties of $f$. In this work we introduce the following property called expansivity: the observation of the sequence of states at any given node is suffic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08007","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"scGVHs5RKKBtFsQfZwQLH1cKDzjrUdNWjjlu9CxZS0x4DP4PpKw81DDzFc4m1y+26lrSTJDl4aZFDa7gwc3cBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:38:30.531062Z"},"content_sha256":"d35e04108ac3f9412ca72414c8a9eef751da2ad97950239190520935075f5b91","schema_version":"1.0","event_id":"sha256:d35e04108ac3f9412ca72414c8a9eef751da2ad97950239190520935075f5b91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65M4LFDEUQXJBL57WAENCGFE77/bundle.json","state_url":"https://pith.science/pith/65M4LFDEUQXJBL57WAENCGFE77/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65M4LFDEUQXJBL57WAENCGFE77/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T09:38:30Z","links":{"resolver":"https://pith.science/pith/65M4LFDEUQXJBL57WAENCGFE77","bundle":"https://pith.science/pith/65M4LFDEUQXJBL57WAENCGFE77/bundle.json","state":"https://pith.science/pith/65M4LFDEUQXJBL57WAENCGFE77/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65M4LFDEUQXJBL57WAENCGFE77/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:65M4LFDEUQXJBL57WAENCGFE77","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a5c9e5ec54587b181d7f0bb90b99aca5a98c3e6b9cb9f2d104cfd0ce1b04eea2","cross_cats_sorted":["math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-21T12:45:51Z","title_canon_sha256":"d5a7f45922362d3bb240ac83375f4781c2a13711ea195bc7cc7b18fdb574124a"},"schema_version":"1.0","source":{"id":"1902.08007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08007","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08007v1","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08007","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"65M4LFDEUQXJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"65M4LFDEUQXJBL57","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"65M4LFDE","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:d35e04108ac3f9412ca72414c8a9eef751da2ad97950239190520935075f5b91","target":"graph","created_at":"2026-05-17T23:53:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An Automata Network is a map ${f:Q^n\\rightarrow Q^n}$ where $Q$ is a finite alphabet. It can be viewed as a network of $n$ entities, each holding a state from $Q$, and evolving according to a deterministic synchronous update rule in such a way that each entity only depends on its neighbors in the network's graph, called interaction graph. A major trend in automata network theory is to understand how the interaction graph affects dynamical properties of $f$. In this work we introduce the following property called expansivity: the observation of the sequence of states at any given node is suffic","authors_text":"Florian Bridoux, Guillaume Theyssier, Maximilien Gadouleau","cross_cats":["math.CO","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-21T12:45:51Z","title":"Expansive Automata Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08007","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:20eacbffedf5ba372d2421a98d64d8450a8bfe3c37eb33545df8cf69ccfe24a9","target":"record","created_at":"2026-05-17T23:53:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a5c9e5ec54587b181d7f0bb90b99aca5a98c3e6b9cb9f2d104cfd0ce1b04eea2","cross_cats_sorted":["math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-21T12:45:51Z","title_canon_sha256":"d5a7f45922362d3bb240ac83375f4781c2a13711ea195bc7cc7b18fdb574124a"},"schema_version":"1.0","source":{"id":"1902.08007","kind":"arxiv","version":1}},"canonical_sha256":"f759c59464a42e90afbfb008d118a4ffebbd9a3dc542fa53735ac6dee12565e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f759c59464a42e90afbfb008d118a4ffebbd9a3dc542fa53735ac6dee12565e6","first_computed_at":"2026-05-17T23:53:02.443041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:02.443041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UmkjpyZ9ahrYxgRdv+vYWUFjRp/fCJ4yVgkCHM2aYdo1SDqojiQnuC76KLvJAg2iCdPtA4DTbBm3HHvffIMPCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:02.443735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20eacbffedf5ba372d2421a98d64d8450a8bfe3c37eb33545df8cf69ccfe24a9","sha256:d35e04108ac3f9412ca72414c8a9eef751da2ad97950239190520935075f5b91"],"state_sha256":"02c5d9c0429694bbb706a47c9f618efaa36cc217045d5f202326fe8e6784dd89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9r1Nn0tnqf6yIax3kSMKjGV/+oZa6UgOszxgbaw/L+DRflHNzIhIY7VLzwQRZF7BAJYB1FVGHQksjnVC4FFxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:38:30.535618Z","bundle_sha256":"70ebc83cd7a8ef03d5b02ded2b9cd824ff610167343d467e0e5d11f4d2d57f53"}}