{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:DNDFN2GB2LIMCL4BZJ2CKJ5S6J","short_pith_number":"pith:DNDFN2GB","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"},"canonical_sha256":"1b4656e8c1d2d0c12f81ca742527b2f262b379d22dd1bdc7d3eaeba5f4be050b","source":{"kind":"arxiv","id":"0709.4497","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.4497","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"arxiv_version","alias_value":"0709.4497v2","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.4497","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"pith_short_12","alias_value":"DNDFN2GB2LIM","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"pith_short_16","alias_value":"DNDFN2GB2LIMCL4B","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"pith_short_8","alias_value":"DNDFN2GB","created_at":"2026-07-04T15:06:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:DNDFN2GB2LIMCL4BZJ2CKJ5S6J","target":"record","payload":{"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"},"canonical_sha256":"1b4656e8c1d2d0c12f81ca742527b2f262b379d22dd1bdc7d3eaeba5f4be050b","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"},"source_kind":"arxiv","source_id":"0709.4497","source_version":2,"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-07-04T15:06:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nuqY0S40XmmiHPeaDwZbhncr+eEjbUD9j6XsUZ9r01h1YGx7x91EUCZS1vz4KRx0J3buHuZ9NsRt89poJpIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:35:34.323433Z"},"content_sha256":"fbd585fccfae002e8e42d4e193ad52e4f3a93f9edd00f6190ec87e294c468e47","schema_version":"1.0","event_id":"sha256:fbd585fccfae002e8e42d4e193ad52e4f3a93f9edd00f6190ec87e294c468e47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:DNDFN2GB2LIMCL4BZJ2CKJ5S6J","target":"graph","payload":{"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"},"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-07-04T15:06:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXVZKDaV7qAVxp301gTIDSIM5RXhhxgMWwLFoZ6BIRRWRiUt3DdEQk5Hf2W+kn2v6qw2Ex4j/LnjQsqQkuogAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:35:34.323811Z"},"content_sha256":"160c1b7a3807d14f0ff742877d3355713fd93f20d91292d515a98508c1951c80","schema_version":"1.0","event_id":"sha256:160c1b7a3807d14f0ff742877d3355713fd93f20d91292d515a98508c1951c80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/bundle.json","state_url":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/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-08-22T11:35:34Z","links":{"resolver":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J","bundle":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/bundle.json","state":"https://pith.science/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNDFN2GB2LIMCL4BZJ2CKJ5S6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:DNDFN2GB2LIMCL4BZJ2CKJ5S6J","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":"04cdcb9b26d424d896c25d750aca33ef4627ba4a64db8f634f738328fb2ac2e1","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.CC","submitted_at":"2007-09-27T20:56:42Z","title_canon_sha256":"f4d93ba62bcf09906dc3b3e54fbba00f0c2d77fffb8c59a9dbb574b87f75b2e4"},"schema_version":"1.0","source":{"id":"0709.4497","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.4497","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"arxiv_version","alias_value":"0709.4497v2","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.4497","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"pith_short_12","alias_value":"DNDFN2GB2LIM","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"pith_short_16","alias_value":"DNDFN2GB2LIMCL4B","created_at":"2026-07-04T15:06:03Z"},{"alias_kind":"pith_short_8","alias_value":"DNDFN2GB","created_at":"2026-07-04T15:06:03Z"}],"graph_snapshots":[{"event_id":"sha256:160c1b7a3807d14f0ff742877d3355713fd93f20d91292d515a98508c1951c80","target":"graph","created_at":"2026-07-04T15:06:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0709.4497/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Fedor Manin","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2007-09-27T20:56:42Z","title":"The complexity of nonrepetitive edge coloring of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.4497","kind":"arxiv","version":2},"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:fbd585fccfae002e8e42d4e193ad52e4f3a93f9edd00f6190ec87e294c468e47","target":"record","created_at":"2026-07-04T15:06:03Z","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":"04cdcb9b26d424d896c25d750aca33ef4627ba4a64db8f634f738328fb2ac2e1","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.CC","submitted_at":"2007-09-27T20:56:42Z","title_canon_sha256":"f4d93ba62bcf09906dc3b3e54fbba00f0c2d77fffb8c59a9dbb574b87f75b2e4"},"schema_version":"1.0","source":{"id":"0709.4497","kind":"arxiv","version":2}},"canonical_sha256":"1b4656e8c1d2d0c12f81ca742527b2f262b379d22dd1bdc7d3eaeba5f4be050b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b4656e8c1d2d0c12f81ca742527b2f262b379d22dd1bdc7d3eaeba5f4be050b","first_computed_at":"2026-07-04T15:06:03.916170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:06:03.916170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1hGvYrne1Pg9ryhnSsHk1ui0rDZRzEuxVqhFMUfo30ZNXO0cBuHQGvcPhDAABc4xFBN7x9JSV5Z/cJoZO6FhBA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:06:03.916527Z","signed_message":"canonical_sha256_bytes"},"source_id":"0709.4497","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbd585fccfae002e8e42d4e193ad52e4f3a93f9edd00f6190ec87e294c468e47","sha256:160c1b7a3807d14f0ff742877d3355713fd93f20d91292d515a98508c1951c80"],"state_sha256":"61a1f4d06d7933d46df44da38c04a2dc0e41e9b1ac42d0696f0bed744aa48397"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hm+tCvSrJ05VpNAz7jdoBUhm67pugQplNpvLKEpqV7C5Z15j6r+bnaumgDZuOpIG/K7Or0U3z8GwiBo/usfVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T11:35:34.326316Z","bundle_sha256":"24d5cfc24460c5952876b8ac4503e07c573d44b981581c029d9088bef599bd77"}}