{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LSHXJV7WYZFGXZ56FIJZ6XG3PO","short_pith_number":"pith:LSHXJV7W","schema_version":"1.0","canonical_sha256":"5c8f74d7f6c64a6be7be2a139f5cdb7bb8ccd7db5e77bb32041d5fa0be1625be","source":{"kind":"arxiv","id":"2607.12078","version":1},"attestation_state":"computed","paper":{"title":"Completely Reachable Road Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Mikhail V. Volkov, Yinfeng Zhu","submitted_at":"2026-07-13T18:55:05Z","abstract_excerpt":"We determine which digraphs admit an edge labeling by letters from a finite alphabet such that the resulting labeled digraph is a completely reachable automaton. Such digraphs are recognizable in polynomial time; however, the problem becomes NP-complete when the size of the label alphabet is fixed. We also classify the digraphs for which every edge labeling results in a completely reachable automaton."},"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":"2607.12078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-07-13T18:55:05Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1ce4c79705186196c4038fa5b4aab92ff56744d73013d5520fdc4874c2b7de04","abstract_canon_sha256":"3a4d7090961fe86527c334a551fc7102e1610646ec38b4956d519b15cb76fe64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-15T00:21:32.027058Z","signature_b64":"Q/JKAjF5cxvVZxm0SJKBun/KEc9dPF7OSs+rPEmUOGrWzOwLjEmfwL53pqpRRTng8TZf7pLg58K1UueU/iq6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c8f74d7f6c64a6be7be2a139f5cdb7bb8ccd7db5e77bb32041d5fa0be1625be","last_reissued_at":"2026-07-15T00:21:32.026268Z","signature_status":"signed_v1","first_computed_at":"2026-07-15T00:21:32.026268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completely Reachable Road Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Mikhail V. Volkov, Yinfeng Zhu","submitted_at":"2026-07-13T18:55:05Z","abstract_excerpt":"We determine which digraphs admit an edge labeling by letters from a finite alphabet such that the resulting labeled digraph is a completely reachable automaton. Such digraphs are recognizable in polynomial time; however, the problem becomes NP-complete when the size of the label alphabet is fixed. We also classify the digraphs for which every edge labeling results in a completely reachable automaton."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.12078","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.12078/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.12078","created_at":"2026-07-15T00:21:32.026702+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.12078v1","created_at":"2026-07-15T00:21:32.026702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.12078","created_at":"2026-07-15T00:21:32.026702+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSHXJV7WYZFG","created_at":"2026-07-15T00:21:32.026702+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSHXJV7WYZFGXZ56","created_at":"2026-07-15T00:21:32.026702+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSHXJV7W","created_at":"2026-07-15T00:21:32.026702+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/LSHXJV7WYZFGXZ56FIJZ6XG3PO","json":"https://pith.science/pith/LSHXJV7WYZFGXZ56FIJZ6XG3PO.json","graph_json":"https://pith.science/api/pith-number/LSHXJV7WYZFGXZ56FIJZ6XG3PO/graph.json","events_json":"https://pith.science/api/pith-number/LSHXJV7WYZFGXZ56FIJZ6XG3PO/events.json","paper":"https://pith.science/paper/LSHXJV7W"},"agent_actions":{"view_html":"https://pith.science/pith/LSHXJV7WYZFGXZ56FIJZ6XG3PO","download_json":"https://pith.science/pith/LSHXJV7WYZFGXZ56FIJZ6XG3PO.json","view_paper":"https://pith.science/paper/LSHXJV7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.12078&json=true","fetch_graph":"https://pith.science/api/pith-number/LSHXJV7WYZFGXZ56FIJZ6XG3PO/graph.json","fetch_events":"https://pith.science/api/pith-number/LSHXJV7WYZFGXZ56FIJZ6XG3PO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSHXJV7WYZFGXZ56FIJZ6XG3PO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSHXJV7WYZFGXZ56FIJZ6XG3PO/action/storage_attestation","attest_author":"https://pith.science/pith/LSHXJV7WYZFGXZ56FIJZ6XG3PO/action/author_attestation","sign_citation":"https://pith.science/pith/LSHXJV7WYZFGXZ56FIJZ6XG3PO/action/citation_signature","submit_replication":"https://pith.science/pith/LSHXJV7WYZFGXZ56FIJZ6XG3PO/action/replication_record"}},"created_at":"2026-07-15T00:21:32.026702+00:00","updated_at":"2026-07-15T00:21:32.026702+00:00"}