{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IJ6UJRCNG3X5JIOFN2NNGMNQV4","short_pith_number":"pith:IJ6UJRCN","schema_version":"1.0","canonical_sha256":"427d44c44d36efd4a1c56e9ad331b0af0d417cc4932d5455a19a8d2f2ec91dc5","source":{"kind":"arxiv","id":"1309.2749","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.2749","created_at":"2026-05-18T03:00:14.590368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2749v1","created_at":"2026-05-18T03:00:14.590368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2749","created_at":"2026-05-18T03:00:14.590368+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJ6UJRCNG3X5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJ6UJRCNG3X5JIOF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJ6UJRCN","created_at":"2026-05-18T12:27:46.883200+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/IJ6UJRCNG3X5JIOFN2NNGMNQV4","json":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4.json","graph_json":"https://pith.science/api/pith-number/IJ6UJRCNG3X5JIOFN2NNGMNQV4/graph.json","events_json":"https://pith.science/api/pith-number/IJ6UJRCNG3X5JIOFN2NNGMNQV4/events.json","paper":"https://pith.science/paper/IJ6UJRCN"},"agent_actions":{"view_html":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4","download_json":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4.json","view_paper":"https://pith.science/paper/IJ6UJRCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2749&json=true","fetch_graph":"https://pith.science/api/pith-number/IJ6UJRCNG3X5JIOFN2NNGMNQV4/graph.json","fetch_events":"https://pith.science/api/pith-number/IJ6UJRCNG3X5JIOFN2NNGMNQV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/action/storage_attestation","attest_author":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/action/author_attestation","sign_citation":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/action/citation_signature","submit_replication":"https://pith.science/pith/IJ6UJRCNG3X5JIOFN2NNGMNQV4/action/replication_record"}},"created_at":"2026-05-18T03:00:14.590368+00:00","updated_at":"2026-05-18T03:00:14.590368+00:00"}