{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M7JJQA3WQILWWDR5AB7AW7BIME","short_pith_number":"pith:M7JJQA3W","canonical_record":{"source":{"id":"1805.02540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-07T14:23:38Z","cross_cats_sorted":[],"title_canon_sha256":"4427e8029040dddbd518481a8670b2f358574b311f9df5333def5b6443d80694","abstract_canon_sha256":"2a7b8414172433e77cf12af2e6d6c9cd7fe1e421b5e348461a61bff43e628f3b"},"schema_version":"1.0"},"canonical_sha256":"67d298037682176b0e3d007e0b7c28610fecd6e20ecca27526da9b0ccc4218d3","source":{"kind":"arxiv","id":"1805.02540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02540","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02540v1","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02540","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"M7JJQA3WQILW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M7JJQA3WQILWWDR5","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M7JJQA3W","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M7JJQA3WQILWWDR5AB7AW7BIME","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-07T14:23:38Z","cross_cats_sorted":[],"title_canon_sha256":"4427e8029040dddbd518481a8670b2f358574b311f9df5333def5b6443d80694","abstract_canon_sha256":"2a7b8414172433e77cf12af2e6d6c9cd7fe1e421b5e348461a61bff43e628f3b"},"schema_version":"1.0"},"canonical_sha256":"67d298037682176b0e3d007e0b7c28610fecd6e20ecca27526da9b0ccc4218d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:39.688234Z","signature_b64":"v+pVVxlyDcjbWF7hKncIQjkSUId6D61ghcmurBYJ1FD00aZeuG4hLJ61ev2FywfEFwAIeUBk9dDRqSTVLDQfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67d298037682176b0e3d007e0b7c28610fecd6e20ecca27526da9b0ccc4218d3","last_reissued_at":"2026-05-18T00:16:39.687704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:39.687704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02540","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-18T00:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Nj58xZ0ZV2OrHcxaKkvx85PMKzIFQYVA4goaVqTYnTHbNBeSwFUnwp8RDQdUz0gdVogQJv1s8lXhhae7X4tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:34:32.102413Z"},"content_sha256":"b385691a06896448e449f4e9f556c971a0d89c6d6742205f90dfc85912febe78","schema_version":"1.0","event_id":"sha256:b385691a06896448e449f4e9f556c971a0d89c6d6742205f90dfc85912febe78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M7JJQA3WQILWWDR5AB7AW7BIME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Completely Reachable Automata and Subset Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Fran\\c{c}ois Gonze, Rapha\\\"el M. Jungers","submitted_at":"2018-05-07T14:23:38Z","abstract_excerpt":"This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset reachability. Moreover, they show that some subsets need exponentially long words to be reached, and that the restriction of the conjecture to included subsets also does not hold. Second, we analyze completely reachable automata and provide a counterexample to the conjecture of Bondar and Volkov about the so-called $\\Gamma_1$-graph. We finally prove an alterna"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02540","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-18T00:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbyLutZGhbi/LAqTtA/YKYZObLU8lXCjGe75WcWLpRruUtq3fqzi9B53kZ6MYqFDFxduORTHFoxkBTo+b0XgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:34:32.103176Z"},"content_sha256":"984f5984f51977807b73401b8fe38fcc044f7336bc44fb18f7c962c333627163","schema_version":"1.0","event_id":"sha256:984f5984f51977807b73401b8fe38fcc044f7336bc44fb18f7c962c333627163"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7JJQA3WQILWWDR5AB7AW7BIME/bundle.json","state_url":"https://pith.science/pith/M7JJQA3WQILWWDR5AB7AW7BIME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7JJQA3WQILWWDR5AB7AW7BIME/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-05-31T16:34:32Z","links":{"resolver":"https://pith.science/pith/M7JJQA3WQILWWDR5AB7AW7BIME","bundle":"https://pith.science/pith/M7JJQA3WQILWWDR5AB7AW7BIME/bundle.json","state":"https://pith.science/pith/M7JJQA3WQILWWDR5AB7AW7BIME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7JJQA3WQILWWDR5AB7AW7BIME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M7JJQA3WQILWWDR5AB7AW7BIME","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":"2a7b8414172433e77cf12af2e6d6c9cd7fe1e421b5e348461a61bff43e628f3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-07T14:23:38Z","title_canon_sha256":"4427e8029040dddbd518481a8670b2f358574b311f9df5333def5b6443d80694"},"schema_version":"1.0","source":{"id":"1805.02540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02540","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02540v1","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02540","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"M7JJQA3WQILW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M7JJQA3WQILWWDR5","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M7JJQA3W","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:984f5984f51977807b73401b8fe38fcc044f7336bc44fb18f7c962c333627163","target":"graph","created_at":"2026-05-18T00:16: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":"This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset reachability. Moreover, they show that some subsets need exponentially long words to be reached, and that the restriction of the conjecture to included subsets also does not hold. Second, we analyze completely reachable automata and provide a counterexample to the conjecture of Bondar and Volkov about the so-called $\\Gamma_1$-graph. We finally prove an alterna","authors_text":"Fran\\c{c}ois Gonze, Rapha\\\"el M. Jungers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-07T14:23:38Z","title":"On Completely Reachable Automata and Subset Reachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02540","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:b385691a06896448e449f4e9f556c971a0d89c6d6742205f90dfc85912febe78","target":"record","created_at":"2026-05-18T00:16: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":"2a7b8414172433e77cf12af2e6d6c9cd7fe1e421b5e348461a61bff43e628f3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-07T14:23:38Z","title_canon_sha256":"4427e8029040dddbd518481a8670b2f358574b311f9df5333def5b6443d80694"},"schema_version":"1.0","source":{"id":"1805.02540","kind":"arxiv","version":1}},"canonical_sha256":"67d298037682176b0e3d007e0b7c28610fecd6e20ecca27526da9b0ccc4218d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67d298037682176b0e3d007e0b7c28610fecd6e20ecca27526da9b0ccc4218d3","first_computed_at":"2026-05-18T00:16:39.687704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:39.687704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v+pVVxlyDcjbWF7hKncIQjkSUId6D61ghcmurBYJ1FD00aZeuG4hLJ61ev2FywfEFwAIeUBk9dDRqSTVLDQfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:39.688234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b385691a06896448e449f4e9f556c971a0d89c6d6742205f90dfc85912febe78","sha256:984f5984f51977807b73401b8fe38fcc044f7336bc44fb18f7c962c333627163"],"state_sha256":"91128dc188bd50b8f134e5e3e85b8690341f974bb285eb158ba82374dac1dfd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OwZp2ao4RE1dKGgeF6d94l6D5H+Kd2aOWOwGPf5IUbykFh6XnZi0EFGZpaYDuBRgZECEUfCXJjlNAnp9AIkJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:34:32.106739Z","bundle_sha256":"d88a4355f31d72055f2bf487b48b531661d7f48f85bd8a9c65c97bc8b085f104"}}