{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:MS2FHKFNLL4SX4DLJGIAFRWZNM","short_pith_number":"pith:MS2FHKFN","schema_version":"1.0","canonical_sha256":"64b453a8ad5af92bf06b499002c6d96b1002b093b70dd09921d5fee31328ad49","source":{"kind":"arxiv","id":"0803.0726","version":9},"attestation_state":"computed","paper":{"title":"A quadratic algorithm for road coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dominique Perrin, Marie-Pierre B\\'eal","submitted_at":"2008-03-05T20:35:54Z","abstract_excerpt":"The Road Coloring Theorem states that every aperiodic directed graph with constant out-degree has a synchronized coloring. This theorem had been conjectured during many years as the Road Coloring Problem before being settled by A. Trahtman. Trahtman's proof leads to an algorithm that finds a synchronized labeling with a cubic worst-case time complexity. We show a variant of his construction with a worst-case complexity which is quadratic in time and linear in space. We also extend the Road Coloring Theorem to the periodic case."},"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":"0803.0726","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-03-05T20:35:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"116607ff961363fb65fe189b286d7683f01b37d8e47fa79f4c1e2ecf2851ec47","abstract_canon_sha256":"337953896e91995e86af183855968b55d1bf1c6bd4e895a5704d6ce841ccffeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:17.633184Z","signature_b64":"gLS14e8sDZs4vZfW9tcyxUU1ttK1AY4c9MHXsMe0ocKB+P7tIgu5XpNSUbty/rM2aRBrLI443cS7WbxnycnzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b453a8ad5af92bf06b499002c6d96b1002b093b70dd09921d5fee31328ad49","last_reissued_at":"2026-05-18T03:22:17.632645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:17.632645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quadratic algorithm for road coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dominique Perrin, Marie-Pierre B\\'eal","submitted_at":"2008-03-05T20:35:54Z","abstract_excerpt":"The Road Coloring Theorem states that every aperiodic directed graph with constant out-degree has a synchronized coloring. This theorem had been conjectured during many years as the Road Coloring Problem before being settled by A. Trahtman. Trahtman's proof leads to an algorithm that finds a synchronized labeling with a cubic worst-case time complexity. We show a variant of his construction with a worst-case complexity which is quadratic in time and linear in space. We also extend the Road Coloring Theorem to the periodic case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0726","kind":"arxiv","version":9},"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":"0803.0726","created_at":"2026-05-18T03:22:17.632735+00:00"},{"alias_kind":"arxiv_version","alias_value":"0803.0726v9","created_at":"2026-05-18T03:22:17.632735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0726","created_at":"2026-05-18T03:22:17.632735+00:00"},{"alias_kind":"pith_short_12","alias_value":"MS2FHKFNLL4S","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"MS2FHKFNLL4SX4DL","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"MS2FHKFN","created_at":"2026-05-18T12:25:57.157939+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/MS2FHKFNLL4SX4DLJGIAFRWZNM","json":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM.json","graph_json":"https://pith.science/api/pith-number/MS2FHKFNLL4SX4DLJGIAFRWZNM/graph.json","events_json":"https://pith.science/api/pith-number/MS2FHKFNLL4SX4DLJGIAFRWZNM/events.json","paper":"https://pith.science/paper/MS2FHKFN"},"agent_actions":{"view_html":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM","download_json":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM.json","view_paper":"https://pith.science/paper/MS2FHKFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0803.0726&json=true","fetch_graph":"https://pith.science/api/pith-number/MS2FHKFNLL4SX4DLJGIAFRWZNM/graph.json","fetch_events":"https://pith.science/api/pith-number/MS2FHKFNLL4SX4DLJGIAFRWZNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/action/storage_attestation","attest_author":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/action/author_attestation","sign_citation":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/action/citation_signature","submit_replication":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/action/replication_record"}},"created_at":"2026-05-18T03:22:17.632735+00:00","updated_at":"2026-05-18T03:22:17.632735+00:00"}