{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:MS2FHKFNLL4SX4DLJGIAFRWZNM","short_pith_number":"pith:MS2FHKFN","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"},"canonical_sha256":"64b453a8ad5af92bf06b499002c6d96b1002b093b70dd09921d5fee31328ad49","source":{"kind":"arxiv","id":"0803.0726","version":9},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.0726","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"0803.0726v9","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0726","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"MS2FHKFNLL4S","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MS2FHKFNLL4SX4DL","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MS2FHKFN","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:MS2FHKFNLL4SX4DLJGIAFRWZNM","target":"record","payload":{"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"},"canonical_sha256":"64b453a8ad5af92bf06b499002c6d96b1002b093b70dd09921d5fee31328ad49","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"},"source_kind":"arxiv","source_id":"0803.0726","source_version":9,"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-18T03:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rc8paH+2Bfq+z24w807WSQvxCKpX/inBNYN1QyV9M2FbxT+ly6LDkXi5J4iqipUr86Dp2UvECMd6G3psHxMJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:48:37.693783Z"},"content_sha256":"54e44bac367416f690e1b9a823e3bd0b922e749c0be8269d2698a3d4f32d9637","schema_version":"1.0","event_id":"sha256:54e44bac367416f690e1b9a823e3bd0b922e749c0be8269d2698a3d4f32d9637"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:MS2FHKFNLL4SX4DLJGIAFRWZNM","target":"graph","payload":{"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"},"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-18T03:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLfy3UtM5TKmSSwDM4SZdO4nPy0e4sipEMDB1geKR/sn8xxpKnFncrUPz4yC+s4ZoN1uQIyHhSd/zUQo8kVUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:48:37.694463Z"},"content_sha256":"d13ace45a4d8875cb8d1bf43e62d37567df9957d0e980342d560eeade8516707","schema_version":"1.0","event_id":"sha256:d13ace45a4d8875cb8d1bf43e62d37567df9957d0e980342d560eeade8516707"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/bundle.json","state_url":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/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-27T13:48:37Z","links":{"resolver":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM","bundle":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/bundle.json","state":"https://pith.science/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MS2FHKFNLL4SX4DLJGIAFRWZNM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:MS2FHKFNLL4SX4DLJGIAFRWZNM","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":"337953896e91995e86af183855968b55d1bf1c6bd4e895a5704d6ce841ccffeb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-03-05T20:35:54Z","title_canon_sha256":"116607ff961363fb65fe189b286d7683f01b37d8e47fa79f4c1e2ecf2851ec47"},"schema_version":"1.0","source":{"id":"0803.0726","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.0726","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"0803.0726v9","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0726","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"MS2FHKFNLL4S","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MS2FHKFNLL4SX4DL","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MS2FHKFN","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:d13ace45a4d8875cb8d1bf43e62d37567df9957d0e980342d560eeade8516707","target":"graph","created_at":"2026-05-18T03:22:17Z","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":"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.","authors_text":"Dominique Perrin, Marie-Pierre B\\'eal","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-03-05T20:35:54Z","title":"A quadratic algorithm for road coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0726","kind":"arxiv","version":9},"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:54e44bac367416f690e1b9a823e3bd0b922e749c0be8269d2698a3d4f32d9637","target":"record","created_at":"2026-05-18T03:22:17Z","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":"337953896e91995e86af183855968b55d1bf1c6bd4e895a5704d6ce841ccffeb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-03-05T20:35:54Z","title_canon_sha256":"116607ff961363fb65fe189b286d7683f01b37d8e47fa79f4c1e2ecf2851ec47"},"schema_version":"1.0","source":{"id":"0803.0726","kind":"arxiv","version":9}},"canonical_sha256":"64b453a8ad5af92bf06b499002c6d96b1002b093b70dd09921d5fee31328ad49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64b453a8ad5af92bf06b499002c6d96b1002b093b70dd09921d5fee31328ad49","first_computed_at":"2026-05-18T03:22:17.632645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:17.632645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gLS14e8sDZs4vZfW9tcyxUU1ttK1AY4c9MHXsMe0ocKB+P7tIgu5XpNSUbty/rM2aRBrLI443cS7WbxnycnzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:17.633184Z","signed_message":"canonical_sha256_bytes"},"source_id":"0803.0726","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54e44bac367416f690e1b9a823e3bd0b922e749c0be8269d2698a3d4f32d9637","sha256:d13ace45a4d8875cb8d1bf43e62d37567df9957d0e980342d560eeade8516707"],"state_sha256":"98a1b12323565e35db5251ad5d386e421444192ca7d91768b56ac4c729d6dbc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtsWvWNdTKnAnVUS1bSSkTwXgmxEr9LREioiLtTE+opmxRc7Cx8cTfqjlNI67+kohkTZSAyskoeNHB9AbbHfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:48:37.697954Z","bundle_sha256":"968759e50a7e0d93f22ff626bf8dfd4c7090e0cc767b28d1e7c452ec74549b9d"}}