{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AP2LMQBBVAJAU4E4GO3W2DAMBG","short_pith_number":"pith:AP2LMQBB","canonical_record":{"source":{"id":"1307.7259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-27T13:31:08Z","cross_cats_sorted":["nlin.CG"],"title_canon_sha256":"cc5dc0aa2ba16c0e54d871c73f5fd9d897e21781c33a3d35470b75dc42727527","abstract_canon_sha256":"045ffb6ada1037f46564430c1b4de93e47325474ef03e2a332c7f4350c2e9448"},"schema_version":"1.0"},"canonical_sha256":"03f4b64021a8120a709c33b76d0c0c09adff05cde1de7364bb5f2e739358a721","source":{"kind":"arxiv","id":"1307.7259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7259","created_at":"2026-05-18T02:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7259v1","created_at":"2026-05-18T02:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7259","created_at":"2026-05-18T02:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"AP2LMQBBVAJA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AP2LMQBBVAJAU4E4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AP2LMQBB","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AP2LMQBBVAJAU4E4GO3W2DAMBG","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-27T13:31:08Z","cross_cats_sorted":["nlin.CG"],"title_canon_sha256":"cc5dc0aa2ba16c0e54d871c73f5fd9d897e21781c33a3d35470b75dc42727527","abstract_canon_sha256":"045ffb6ada1037f46564430c1b4de93e47325474ef03e2a332c7f4350c2e9448"},"schema_version":"1.0"},"canonical_sha256":"03f4b64021a8120a709c33b76d0c0c09adff05cde1de7364bb5f2e739358a721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:39.060589Z","signature_b64":"nt3vs6FsTI+xChWwaWhbgd3GhgXe4fKqkjapgqxtO/EST5k7Y++/W+i0r5FhL2suSlxoUinsoF4HFqobW6dyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03f4b64021a8120a709c33b76d0c0c09adff05cde1de7364bb5f2e739358a721","last_reissued_at":"2026-05-18T02:32:39.060200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:39.060200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7259","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-18T02:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zShnocLHC9VnIjcNGIuOGa9fq3SQbOnIvWd8pW10TPuGe2/8I+MByIT7LqyHqmrr7q56+3eaAaCjTwlAV6uVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:12:31.022933Z"},"content_sha256":"7fff01ee52597ab4966530a2891ead433567393e29a225091cd6bc6e78d57e91","schema_version":"1.0","event_id":"sha256:7fff01ee52597ab4966530a2891ead433567393e29a225091cd6bc6e78d57e91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AP2LMQBBVAJAU4E4GO3W2DAMBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The predecessor-existence problem for k-reversible processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CG"],"primary_cat":"cs.DS","authors_text":"F\\'abio Protti, Leonardo I. L. Oliveira, Valmir C. Barbosa","submitted_at":"2013-07-27T13:31:08Z","abstract_excerpt":"For k>=1, we consider the graph dynamical system known as a k-reversible process. In such process, each vertex in the graph has one of two possible states at each discrete time. Each vertex changes its state between the present time and the next if and only if it currently has at least k neighbors in a state different than its own. Given a k-reversible process and a configuration of states assigned to the vertices, the Predecessor Existence problem consists of determining whether this configuration can be generated by the process from another configuration within exactly one time step. We can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7259","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-18T02:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FIzVbqi8AfZYKEGS5Dh21uddZ79hTYrRbGGwdwxkLgjUfq1V4xl9eqEKgRnixD5X6nw0MYnp40YajGvCfRVsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:12:31.023270Z"},"content_sha256":"6ff4f8b0ef967887142e2d11f539ba21b8e0f8adcd0fa271178659d281cbdb7b","schema_version":"1.0","event_id":"sha256:6ff4f8b0ef967887142e2d11f539ba21b8e0f8adcd0fa271178659d281cbdb7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/bundle.json","state_url":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/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-22T12:12:31Z","links":{"resolver":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG","bundle":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/bundle.json","state":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AP2LMQBBVAJAU4E4GO3W2DAMBG","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":"045ffb6ada1037f46564430c1b4de93e47325474ef03e2a332c7f4350c2e9448","cross_cats_sorted":["nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-27T13:31:08Z","title_canon_sha256":"cc5dc0aa2ba16c0e54d871c73f5fd9d897e21781c33a3d35470b75dc42727527"},"schema_version":"1.0","source":{"id":"1307.7259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7259","created_at":"2026-05-18T02:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7259v1","created_at":"2026-05-18T02:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7259","created_at":"2026-05-18T02:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"AP2LMQBBVAJA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AP2LMQBBVAJAU4E4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AP2LMQBB","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:6ff4f8b0ef967887142e2d11f539ba21b8e0f8adcd0fa271178659d281cbdb7b","target":"graph","created_at":"2026-05-18T02:32:39Z","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":"For k>=1, we consider the graph dynamical system known as a k-reversible process. In such process, each vertex in the graph has one of two possible states at each discrete time. Each vertex changes its state between the present time and the next if and only if it currently has at least k neighbors in a state different than its own. Given a k-reversible process and a configuration of states assigned to the vertices, the Predecessor Existence problem consists of determining whether this configuration can be generated by the process from another configuration within exactly one time step. We can ","authors_text":"F\\'abio Protti, Leonardo I. L. Oliveira, Valmir C. Barbosa","cross_cats":["nlin.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-27T13:31:08Z","title":"The predecessor-existence problem for k-reversible processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7259","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:7fff01ee52597ab4966530a2891ead433567393e29a225091cd6bc6e78d57e91","target":"record","created_at":"2026-05-18T02:32:39Z","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":"045ffb6ada1037f46564430c1b4de93e47325474ef03e2a332c7f4350c2e9448","cross_cats_sorted":["nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-27T13:31:08Z","title_canon_sha256":"cc5dc0aa2ba16c0e54d871c73f5fd9d897e21781c33a3d35470b75dc42727527"},"schema_version":"1.0","source":{"id":"1307.7259","kind":"arxiv","version":1}},"canonical_sha256":"03f4b64021a8120a709c33b76d0c0c09adff05cde1de7364bb5f2e739358a721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03f4b64021a8120a709c33b76d0c0c09adff05cde1de7364bb5f2e739358a721","first_computed_at":"2026-05-18T02:32:39.060200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:39.060200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nt3vs6FsTI+xChWwaWhbgd3GhgXe4fKqkjapgqxtO/EST5k7Y++/W+i0r5FhL2suSlxoUinsoF4HFqobW6dyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:39.060589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fff01ee52597ab4966530a2891ead433567393e29a225091cd6bc6e78d57e91","sha256:6ff4f8b0ef967887142e2d11f539ba21b8e0f8adcd0fa271178659d281cbdb7b"],"state_sha256":"7944e0038ae0571f98fd02662a4dbc6adb9028929eb150671b6979c11269add9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZqwB3luKPgovvZhXhW0FFkMOFfbv7H1a3b1KfXsQq08a3JW7fNnvn7EDC0ctBnFgp7NnFaze7edkbiGE08HDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:12:31.025160Z","bundle_sha256":"4a3002b8de596ac0c5854e9fb02b00060f60a4ea73db41bd94a30adf93960d3e"}}