{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:DNDFN2GB2LIMCL4BZJ2CKJ5S6J","short_pith_number":"pith:DNDFN2GB","schema_version":"1.0","canonical_sha256":"1b4656e8c1d2d0c12f81ca742527b2f262b379d22dd1bdc7d3eaeba5f4be050b","source":{"kind":"arxiv","id":"0709.4497","version":2},"attestation_state":"computed","paper":{"title":"The complexity of nonrepetitive edge coloring of graphs","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Fedor Manin","submitted_at":"2007-09-27T20:56:42Z","abstract_excerpt":"A squarefree word is a sequence $w$ of symbols such that there are no strings $x, y$, and $z$ for which $w=xyyz$. A nonrepetitive coloring of a graph is an edge coloring in which the sequence of colors along any open path is squarefree. We show that determining whether a graph $G$ has a nonrepetitive $k$-coloring is $\\Sigma_2^p$-complete. When we restrict to paths of lengths at most $n$, the problem becomes NP-complete for fixed $n$."},"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":"0709.4497","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2007-09-27T20:56:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f4d93ba62bcf09906dc3b3e54fbba00f0c2d77fffb8c59a9dbb574b87f75b2e4","abstract_canon_sha256":"04cdcb9b26d424d896c25d750aca33ef4627ba4a64db8f634f738328fb2ac2e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:06:03.916527Z","signature_b64":"1hGvYrne1Pg9ryhnSsHk1ui0rDZRzEuxVqhFMUfo30ZNXO0cBuHQGvcPhDAABc4xFBN7x9JSV5Z/cJoZO6FhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b4656e8c1d2d0c12f81ca742527b2f262b379d22dd1bdc7d3eaeba5f4be050b","last_reissued_at":"2026-07-04T15:06:03.916170Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:06:03.916170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of nonrepetitive edge coloring of graphs","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Fedor Manin","submitted_at":"2007-09-27T20:56:42Z","abstract_excerpt":"A squarefree word is a sequence $w$ of symbols such that there are no strings $x, y$, and $z$ for which $w=xyyz$. A nonrepetitive coloring of a graph is an edge coloring in which the sequence of colors along any open path is squarefree. We show that determining whether a graph $G$ has a nonrepetitive $k$-coloring is $\\Sigma_2^p$-complete. When we restrict to paths of lengths at most $n$, the problem becomes NP-complete for fixed $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.4497","kind":"arxiv","version":2},"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/0709.4497/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":"0709.4497","created_at":"2026-07-04T15:06:03.916228+00:00"},{"alias_kind":"arxiv_version","alias_value":"0709.4497v2","created_at":"2026-07-04T15:06:03.916228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.4497","created_at":"2026-07-04T15:06:03.916228+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNDFN2GB2LIM","created_at":"2026-07-04T15:06:03.916228+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNDFN2GB2LIMCL4B","created_at":"2026-07-04T15:06:03.916228+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNDFN2GB","created_at":"2026-07-04T15:06:03.916228+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/DNDFN2GB2LIMCL4BZJ2CKJ5S6J","json":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J.json","graph_json":"https://pith.science/api/pith-number/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/graph.json","events_json":"https://pith.science/api/pith-number/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/events.json","paper":"https://pith.science/paper/DNDFN2GB"},"agent_actions":{"view_html":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J","download_json":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J.json","view_paper":"https://pith.science/paper/DNDFN2GB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0709.4497&json=true","fetch_graph":"https://pith.science/api/pith-number/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/graph.json","fetch_events":"https://pith.science/api/pith-number/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/action/storage_attestation","attest_author":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/action/author_attestation","sign_citation":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/action/citation_signature","submit_replication":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/action/replication_record"}},"created_at":"2026-07-04T15:06:03.916228+00:00","updated_at":"2026-07-04T15:06:03.916228+00:00"}