{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FADJQSCAJJK57X57VTO6TZHJP3","short_pith_number":"pith:FADJQSCA","schema_version":"1.0","canonical_sha256":"28069848404a55dfdfbfacdde9e4e97ee7dc244541d5fff7e9d738c3cba22f2c","source":{"kind":"arxiv","id":"1501.03992","version":1},"attestation_state":"computed","paper":{"title":"PSPACE-Completeness of Majority Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eric Goles, Ilkka T\\\"orm\\\"a, Pedro Montealegre, Ville Salo","submitted_at":"2015-01-16T14:42:49Z","abstract_excerpt":"We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete."},"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":"1501.03992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-16T14:42:49Z","cross_cats_sorted":[],"title_canon_sha256":"c8245cbd03981974d574de7b74640c0969cfe49e993309a38ff2258177a0a14d","abstract_canon_sha256":"52cccef651941c52c1d11e8814ca8fa59ceb64ee40d6f7d6c2aefc47597153d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:16.557659Z","signature_b64":"EtLcl4JyQaZj9jyJF1Of7+5MiI+G/zkjo1pckzkijxrS+5G2Yv6UYS6dE74WXhABCh4dmsk4IiN1pVjErqgoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28069848404a55dfdfbfacdde9e4e97ee7dc244541d5fff7e9d738c3cba22f2c","last_reissued_at":"2026-05-18T02:29:16.557227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:16.557227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PSPACE-Completeness of Majority Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eric Goles, Ilkka T\\\"orm\\\"a, Pedro Montealegre, Ville Salo","submitted_at":"2015-01-16T14:42:49Z","abstract_excerpt":"We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03992","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":"1501.03992","created_at":"2026-05-18T02:29:16.557292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03992v1","created_at":"2026-05-18T02:29:16.557292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03992","created_at":"2026-05-18T02:29:16.557292+00:00"},{"alias_kind":"pith_short_12","alias_value":"FADJQSCAJJK5","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FADJQSCAJJK57X57","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FADJQSCA","created_at":"2026-05-18T12:29:19.899920+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/FADJQSCAJJK57X57VTO6TZHJP3","json":"https://pith.science/pith/FADJQSCAJJK57X57VTO6TZHJP3.json","graph_json":"https://pith.science/api/pith-number/FADJQSCAJJK57X57VTO6TZHJP3/graph.json","events_json":"https://pith.science/api/pith-number/FADJQSCAJJK57X57VTO6TZHJP3/events.json","paper":"https://pith.science/paper/FADJQSCA"},"agent_actions":{"view_html":"https://pith.science/pith/FADJQSCAJJK57X57VTO6TZHJP3","download_json":"https://pith.science/pith/FADJQSCAJJK57X57VTO6TZHJP3.json","view_paper":"https://pith.science/paper/FADJQSCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03992&json=true","fetch_graph":"https://pith.science/api/pith-number/FADJQSCAJJK57X57VTO6TZHJP3/graph.json","fetch_events":"https://pith.science/api/pith-number/FADJQSCAJJK57X57VTO6TZHJP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FADJQSCAJJK57X57VTO6TZHJP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FADJQSCAJJK57X57VTO6TZHJP3/action/storage_attestation","attest_author":"https://pith.science/pith/FADJQSCAJJK57X57VTO6TZHJP3/action/author_attestation","sign_citation":"https://pith.science/pith/FADJQSCAJJK57X57VTO6TZHJP3/action/citation_signature","submit_replication":"https://pith.science/pith/FADJQSCAJJK57X57VTO6TZHJP3/action/replication_record"}},"created_at":"2026-05-18T02:29:16.557292+00:00","updated_at":"2026-05-18T02:29:16.557292+00:00"}