{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3ICJ5BFUMGB2VJRD4TK45QMB64","short_pith_number":"pith:3ICJ5BFU","canonical_record":{"source":{"id":"1608.05548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-19T09:31:45Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"569fb1f4a36511ab8769a8dcc4bfe9049a3d7494c994e7648be5f5f11af01872","abstract_canon_sha256":"f8745919188d75ab2f95eeec6f1686b5dea0d1d9f8dcf3b902b03956a2d0cb7b"},"schema_version":"1.0"},"canonical_sha256":"da049e84b46183aaa623e4d5cec181f707e4b678e3a5396b6a69ea430a3d0f5f","source":{"kind":"arxiv","id":"1608.05548","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05548","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05548v1","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05548","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"3ICJ5BFUMGB2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3ICJ5BFUMGB2VJRD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3ICJ5BFU","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3ICJ5BFUMGB2VJRD4TK45QMB64","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-19T09:31:45Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"569fb1f4a36511ab8769a8dcc4bfe9049a3d7494c994e7648be5f5f11af01872","abstract_canon_sha256":"f8745919188d75ab2f95eeec6f1686b5dea0d1d9f8dcf3b902b03956a2d0cb7b"},"schema_version":"1.0"},"canonical_sha256":"da049e84b46183aaa623e4d5cec181f707e4b678e3a5396b6a69ea430a3d0f5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:12.076380Z","signature_b64":"WlBBxiox+5LCiPZikNplAUw27jMLmJh6oaLscdLeyzbw7Zlw1c9DbF8obQKnThTwiUnIrCSgHGMyJyF8KA7hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da049e84b46183aaa623e4d5cec181f707e4b678e3a5396b6a69ea430a3d0f5f","last_reissued_at":"2026-05-18T01:00:12.075589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:12.075589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05548","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-18T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvN7DjFwD+AOM5B2ZuGb90Sc0iB0ZMJzXoHiXVVqJI2Ddwk3fgrZZ67iG9HSB5w0d7SHTX6euZe92p3OxgdeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:53:27.264398Z"},"content_sha256":"d669c7949b35ed2cd5af3efa66b0bfff175c883322673b6f3ae53efd312c8ecf","schema_version":"1.0","event_id":"sha256:d669c7949b35ed2cd5af3efa66b0bfff175c883322673b6f3ae53efd312c8ecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3ICJ5BFUMGB2VJRD4TK45QMB64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Goal-Oriented Reduction of Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"cs.LO","authors_text":"Lo\\\"ic Paulev\\'e","submitted_at":"2016-08-19T09:31:45Z","abstract_excerpt":"We consider networks of finite-state machines having local transitions conditioned by the current state of other automata. In this paper, we depict a reduction procedure tailored for a given reachability property of the form ``from global state s there exists a sequence of transitions leading to a state where an automaton g is in a local state T'. By exploiting a causality analysis of the transitions within the individual automata, the proposed reduction removes local transitions while preserving all the minimal traces that satisfy the reachability property. The complexity of the procedure is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05548","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-18T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92JXT+r0c3Ugb3QBzNHSyD4+qepnLAV5jPsRJQIhYCNb5+BHkih+zv3s7oY8JCH1EIoY6LxEwrAwSv3h7Of4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:53:27.265171Z"},"content_sha256":"60e521a241737f680af4276378d035cd9c19e3dc9c65e3103248bcd5ab9e6668","schema_version":"1.0","event_id":"sha256:60e521a241737f680af4276378d035cd9c19e3dc9c65e3103248bcd5ab9e6668"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ICJ5BFUMGB2VJRD4TK45QMB64/bundle.json","state_url":"https://pith.science/pith/3ICJ5BFUMGB2VJRD4TK45QMB64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ICJ5BFUMGB2VJRD4TK45QMB64/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-09T16:53:27Z","links":{"resolver":"https://pith.science/pith/3ICJ5BFUMGB2VJRD4TK45QMB64","bundle":"https://pith.science/pith/3ICJ5BFUMGB2VJRD4TK45QMB64/bundle.json","state":"https://pith.science/pith/3ICJ5BFUMGB2VJRD4TK45QMB64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ICJ5BFUMGB2VJRD4TK45QMB64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3ICJ5BFUMGB2VJRD4TK45QMB64","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":"f8745919188d75ab2f95eeec6f1686b5dea0d1d9f8dcf3b902b03956a2d0cb7b","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-19T09:31:45Z","title_canon_sha256":"569fb1f4a36511ab8769a8dcc4bfe9049a3d7494c994e7648be5f5f11af01872"},"schema_version":"1.0","source":{"id":"1608.05548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05548","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05548v1","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05548","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"3ICJ5BFUMGB2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3ICJ5BFUMGB2VJRD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3ICJ5BFU","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:60e521a241737f680af4276378d035cd9c19e3dc9c65e3103248bcd5ab9e6668","target":"graph","created_at":"2026-05-18T01:00:12Z","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":"We consider networks of finite-state machines having local transitions conditioned by the current state of other automata. In this paper, we depict a reduction procedure tailored for a given reachability property of the form ``from global state s there exists a sequence of transitions leading to a state where an automaton g is in a local state T'. By exploiting a causality analysis of the transitions within the individual automata, the proposed reduction removes local transitions while preserving all the minimal traces that satisfy the reachability property. The complexity of the procedure is ","authors_text":"Lo\\\"ic Paulev\\'e","cross_cats":["cs.DM","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-19T09:31:45Z","title":"Goal-Oriented Reduction of Automata Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05548","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:d669c7949b35ed2cd5af3efa66b0bfff175c883322673b6f3ae53efd312c8ecf","target":"record","created_at":"2026-05-18T01:00:12Z","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":"f8745919188d75ab2f95eeec6f1686b5dea0d1d9f8dcf3b902b03956a2d0cb7b","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-19T09:31:45Z","title_canon_sha256":"569fb1f4a36511ab8769a8dcc4bfe9049a3d7494c994e7648be5f5f11af01872"},"schema_version":"1.0","source":{"id":"1608.05548","kind":"arxiv","version":1}},"canonical_sha256":"da049e84b46183aaa623e4d5cec181f707e4b678e3a5396b6a69ea430a3d0f5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da049e84b46183aaa623e4d5cec181f707e4b678e3a5396b6a69ea430a3d0f5f","first_computed_at":"2026-05-18T01:00:12.075589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:12.075589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WlBBxiox+5LCiPZikNplAUw27jMLmJh6oaLscdLeyzbw7Zlw1c9DbF8obQKnThTwiUnIrCSgHGMyJyF8KA7hCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:12.076380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d669c7949b35ed2cd5af3efa66b0bfff175c883322673b6f3ae53efd312c8ecf","sha256:60e521a241737f680af4276378d035cd9c19e3dc9c65e3103248bcd5ab9e6668"],"state_sha256":"b4d8216652485461200c99c20efad73662b2f50ab18508277f9fa1ce7527767f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYsZY47kohsYxRg0zATcwai5zkhSoB66pXTiiVoX+yls/IJM8mBId2VNj3fr2YoexNoMT+ASiA4wAhnPwPJfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:53:27.269359Z","bundle_sha256":"77adcc491d17f6c5eccb0095d104559f83ab533168490a909119fcf595da0456"}}