{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QGB6QYSARUOKXD65BY6M3OQHCV","short_pith_number":"pith:QGB6QYSA","schema_version":"1.0","canonical_sha256":"8183e862408d1cab8fdd0e3ccdba0715575b05c36bd4ab67856dab92b86a38e5","source":{"kind":"arxiv","id":"1310.7741","version":1},"attestation_state":"computed","paper":{"title":"Greedy Graph Colouring is a Misleading Heuristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ciaran McCreesh, Patrick Prosser","submitted_at":"2013-10-29T10:23:35Z","abstract_excerpt":"State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and bound."},"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":"1310.7741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-29T10:23:35Z","cross_cats_sorted":[],"title_canon_sha256":"43a8d3d3db31a81e5f32f03eb63d8cfba300be66fcac034b2b50ae341866bf5a","abstract_canon_sha256":"17c13141c7a43feb31936821f6bc9cd788080eddd42f9f9bc4ac5b17f736716d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:35.395296Z","signature_b64":"/7cJXa9EovwNRFEIBQMOLUm063ldI3PCbIXtVCUAFLFkWEWJjVMFwFtkL8zSiVdd5nagx8JJB1gKgM+XkzpWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8183e862408d1cab8fdd0e3ccdba0715575b05c36bd4ab67856dab92b86a38e5","last_reissued_at":"2026-05-18T03:08:35.394807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:35.394807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Graph Colouring is a Misleading Heuristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ciaran McCreesh, Patrick Prosser","submitted_at":"2013-10-29T10:23:35Z","abstract_excerpt":"State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7741","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":"1310.7741","created_at":"2026-05-18T03:08:35.394876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7741v1","created_at":"2026-05-18T03:08:35.394876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7741","created_at":"2026-05-18T03:08:35.394876+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGB6QYSARUOK","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGB6QYSARUOKXD65","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGB6QYSA","created_at":"2026-05-18T12:27:57.521954+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/QGB6QYSARUOKXD65BY6M3OQHCV","json":"https://pith.science/pith/QGB6QYSARUOKXD65BY6M3OQHCV.json","graph_json":"https://pith.science/api/pith-number/QGB6QYSARUOKXD65BY6M3OQHCV/graph.json","events_json":"https://pith.science/api/pith-number/QGB6QYSARUOKXD65BY6M3OQHCV/events.json","paper":"https://pith.science/paper/QGB6QYSA"},"agent_actions":{"view_html":"https://pith.science/pith/QGB6QYSARUOKXD65BY6M3OQHCV","download_json":"https://pith.science/pith/QGB6QYSARUOKXD65BY6M3OQHCV.json","view_paper":"https://pith.science/paper/QGB6QYSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7741&json=true","fetch_graph":"https://pith.science/api/pith-number/QGB6QYSARUOKXD65BY6M3OQHCV/graph.json","fetch_events":"https://pith.science/api/pith-number/QGB6QYSARUOKXD65BY6M3OQHCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGB6QYSARUOKXD65BY6M3OQHCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGB6QYSARUOKXD65BY6M3OQHCV/action/storage_attestation","attest_author":"https://pith.science/pith/QGB6QYSARUOKXD65BY6M3OQHCV/action/author_attestation","sign_citation":"https://pith.science/pith/QGB6QYSARUOKXD65BY6M3OQHCV/action/citation_signature","submit_replication":"https://pith.science/pith/QGB6QYSARUOKXD65BY6M3OQHCV/action/replication_record"}},"created_at":"2026-05-18T03:08:35.394876+00:00","updated_at":"2026-05-18T03:08:35.394876+00:00"}