{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IJ6UJRCNG3X5JIOFN2NNGMNQV4","short_pith_number":"pith:IJ6UJRCN","canonical_record":{"source":{"id":"1309.2749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-11T07:46:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"38193da27e40c4348fa79a733ded0025be0835b29ef91afe8b24dd73e478b485","abstract_canon_sha256":"20a5404a8da8286a6aaf6399d35f50ac7ae65b5def09d919d09d44033a646f78"},"schema_version":"1.0"},"canonical_sha256":"427d44c44d36efd4a1c56e9ad331b0af0d417cc4932d5455a19a8d2f2ec91dc5","source":{"kind":"arxiv","id":"1309.2749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2749","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2749v1","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2749","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"IJ6UJRCNG3X5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IJ6UJRCNG3X5JIOF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IJ6UJRCN","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IJ6UJRCNG3X5JIOFN2NNGMNQV4","target":"record","payload":{"canonical_record":{"source":{"id":"1309.2749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-11T07:46:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"38193da27e40c4348fa79a733ded0025be0835b29ef91afe8b24dd73e478b485","abstract_canon_sha256":"20a5404a8da8286a6aaf6399d35f50ac7ae65b5def09d919d09d44033a646f78"},"schema_version":"1.0"},"canonical_sha256":"427d44c44d36efd4a1c56e9ad331b0af0d417cc4932d5455a19a8d2f2ec91dc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:14.590868Z","signature_b64":"ufiibks7Ri/GRtFZXXkInnRAqBgDmAMNrhaXJ20LVQodE4nnb+Vy5527uP08QYbRUnDQWovNnkAjWeY+2gBCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"427d44c44d36efd4a1c56e9ad331b0af0d417cc4932d5455a19a8d2f2ec91dc5","last_reissued_at":"2026-05-18T03:00:14.590261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:14.590261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.2749","source_version":1,"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:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ciug5j/IhbnHc+JVPa4S9aP5ItOPw0nMFaHJ0OnCHG/eB0/b2PaNwoRwxd/DGBdZTIiUHgGsf63J9Pmmi4glDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:19:20.222430Z"},"content_sha256":"d3ca3a2081e017892a3f02b6d677e0abdb5f72f4541b24c4715e804472f06d2f","schema_version":"1.0","event_id":"sha256:d3ca3a2081e017892a3f02b6d677e0abdb5f72f4541b24c4715e804472f06d2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IJ6UJRCNG3X5JIOFN2NNGMNQV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of colouring problems restricted to unichord-free and \\{square,unichord\\}-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Celina M. H. de Figueiredo, Nicolas Trotignon, Raphael C. S. Machado","submitted_at":"2013-09-11T07:46:22Z","abstract_excerpt":"A \\emph{unichord} in a graph is an edge that is the unique chord of a cycle. A \\emph{square} is an induced cycle on four vertices. A graph is \\emph{unichord-free} if none of its edges is a unichord. We give a slight restatement of a known structure theorem for unichord-free graphs and use it to show that, with the only exception of the complete graph $K_4$, every square-free, unichord-free graph of maximum degree~3 can be total-coloured with four colours. Our proof can be turned into a polynomial time algorithm that actually outputs the colouring. This settles the class of square-free, unichor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2749","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":""},"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:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Atx4EFxlDAyqksO82rAz2zAMfKNG4hq8O9VH2ublMZr75N0nX0O+0ZJ1ox/DdJVyXTz27skFkeza9ZQFtzcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:19:20.222781Z"},"content_sha256":"1c6bef5c54757bb5315688f97fe098a89a556ba64c1167f548ac2925768e13bc","schema_version":"1.0","event_id":"sha256:1c6bef5c54757bb5315688f97fe098a89a556ba64c1167f548ac2925768e13bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/bundle.json","state_url":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/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-06-24T18:19:20Z","links":{"resolver":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4","bundle":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/bundle.json","state":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IJ6UJRCNG3X5JIOFN2NNGMNQV4","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":"20a5404a8da8286a6aaf6399d35f50ac7ae65b5def09d919d09d44033a646f78","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-11T07:46:22Z","title_canon_sha256":"38193da27e40c4348fa79a733ded0025be0835b29ef91afe8b24dd73e478b485"},"schema_version":"1.0","source":{"id":"1309.2749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2749","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2749v1","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2749","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"IJ6UJRCNG3X5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IJ6UJRCNG3X5JIOF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IJ6UJRCN","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:1c6bef5c54757bb5315688f97fe098a89a556ba64c1167f548ac2925768e13bc","target":"graph","created_at":"2026-05-18T03:00:14Z","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":"A \\emph{unichord} in a graph is an edge that is the unique chord of a cycle. A \\emph{square} is an induced cycle on four vertices. A graph is \\emph{unichord-free} if none of its edges is a unichord. We give a slight restatement of a known structure theorem for unichord-free graphs and use it to show that, with the only exception of the complete graph $K_4$, every square-free, unichord-free graph of maximum degree~3 can be total-coloured with four colours. Our proof can be turned into a polynomial time algorithm that actually outputs the colouring. This settles the class of square-free, unichor","authors_text":"Celina M. H. de Figueiredo, Nicolas Trotignon, Raphael C. S. Machado","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-11T07:46:22Z","title":"Complexity of colouring problems restricted to unichord-free and \\{square,unichord\\}-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2749","kind":"arxiv","version":1},"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:d3ca3a2081e017892a3f02b6d677e0abdb5f72f4541b24c4715e804472f06d2f","target":"record","created_at":"2026-05-18T03:00:14Z","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":"20a5404a8da8286a6aaf6399d35f50ac7ae65b5def09d919d09d44033a646f78","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-11T07:46:22Z","title_canon_sha256":"38193da27e40c4348fa79a733ded0025be0835b29ef91afe8b24dd73e478b485"},"schema_version":"1.0","source":{"id":"1309.2749","kind":"arxiv","version":1}},"canonical_sha256":"427d44c44d36efd4a1c56e9ad331b0af0d417cc4932d5455a19a8d2f2ec91dc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"427d44c44d36efd4a1c56e9ad331b0af0d417cc4932d5455a19a8d2f2ec91dc5","first_computed_at":"2026-05-18T03:00:14.590261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:14.590261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ufiibks7Ri/GRtFZXXkInnRAqBgDmAMNrhaXJ20LVQodE4nnb+Vy5527uP08QYbRUnDQWovNnkAjWeY+2gBCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:14.590868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.2749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3ca3a2081e017892a3f02b6d677e0abdb5f72f4541b24c4715e804472f06d2f","sha256:1c6bef5c54757bb5315688f97fe098a89a556ba64c1167f548ac2925768e13bc"],"state_sha256":"8f04d14e054ff2b8db8a7dc3ebe6bc764e81c0f2da6e5e7fafc80b8642544a51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ZKDggN7oV764DrEP7//1yt66vtKHjawWZc47RPPxHucMm/O5L0akiXi9TjktHBXY5/sFgqJcgfjBOg4pgJ9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:19:20.224668Z","bundle_sha256":"afbb4da2ec9fc89f30899f795fc21228fb23f58ddaa192c4e41dafadb134366f"}}