{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AP2LMQBBVAJAU4E4GO3W2DAMBG","short_pith_number":"pith:AP2LMQBB","schema_version":"1.0","canonical_sha256":"03f4b64021a8120a709c33b76d0c0c09adff05cde1de7364bb5f2e739358a721","source":{"kind":"arxiv","id":"1307.7259","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.7259","created_at":"2026-05-18T02:32:39.060255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7259v1","created_at":"2026-05-18T02:32:39.060255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7259","created_at":"2026-05-18T02:32:39.060255+00:00"},{"alias_kind":"pith_short_12","alias_value":"AP2LMQBBVAJA","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AP2LMQBBVAJAU4E4","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AP2LMQBB","created_at":"2026-05-18T12:27:38.830355+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/AP2LMQBBVAJAU4E4GO3W2DAMBG","json":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG.json","graph_json":"https://pith.science/api/pith-number/AP2LMQBBVAJAU4E4GO3W2DAMBG/graph.json","events_json":"https://pith.science/api/pith-number/AP2LMQBBVAJAU4E4GO3W2DAMBG/events.json","paper":"https://pith.science/paper/AP2LMQBB"},"agent_actions":{"view_html":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG","download_json":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG.json","view_paper":"https://pith.science/paper/AP2LMQBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7259&json=true","fetch_graph":"https://pith.science/api/pith-number/AP2LMQBBVAJAU4E4GO3W2DAMBG/graph.json","fetch_events":"https://pith.science/api/pith-number/AP2LMQBBVAJAU4E4GO3W2DAMBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/action/storage_attestation","attest_author":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/action/author_attestation","sign_citation":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/action/citation_signature","submit_replication":"https://pith.science/pith/AP2LMQBBVAJAU4E4GO3W2DAMBG/action/replication_record"}},"created_at":"2026-05-18T02:32:39.060255+00:00","updated_at":"2026-05-18T02:32:39.060255+00:00"}