{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LAAY4CRVGDYCJVM3MVTWIXUQJW","short_pith_number":"pith:LAAY4CRV","schema_version":"1.0","canonical_sha256":"58018e0a3530f024d59b6567645e904d986c07939e360a31410b86d55e8c9fe4","source":{"kind":"arxiv","id":"1704.00316","version":1},"attestation_state":"computed","paper":{"title":"Solving the clique cover problem on (bull, $C_4$)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ch\\'inh T. Ho\\`ang, Kathie Cameron","submitted_at":"2017-04-02T15:29:19Z","abstract_excerpt":"We give an $O(n^4)$ algorithm to find a minimum clique cover of a (bull, $C_4$)-free graph, or equivalently, a minimum colouring of a (bull, $2K_2$)-free graph, where $n$ is the number of vertices of the graphs."},"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":"1704.00316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-02T15:29:19Z","cross_cats_sorted":[],"title_canon_sha256":"e3e19e4b0d2a75eb3ac1b3054f5f6484de61ccee3f0c29c14110ae3649fa9c09","abstract_canon_sha256":"a529c4185993acecf183379fbc60a3531ffd130ae5d44412c5b3b137d10c29bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:24.797777Z","signature_b64":"c5totJw69BQzqDjzmFFAnENoWfsZeYMJj2EiugOakgFEcLMTtRj8+IBGGcEPmInxzmiOnDrATU1aCavSu4WGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58018e0a3530f024d59b6567645e904d986c07939e360a31410b86d55e8c9fe4","last_reissued_at":"2026-05-18T00:47:24.797105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:24.797105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the clique cover problem on (bull, $C_4$)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ch\\'inh T. Ho\\`ang, Kathie Cameron","submitted_at":"2017-04-02T15:29:19Z","abstract_excerpt":"We give an $O(n^4)$ algorithm to find a minimum clique cover of a (bull, $C_4$)-free graph, or equivalently, a minimum colouring of a (bull, $2K_2$)-free graph, where $n$ is the number of vertices of the graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00316","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":"1704.00316","created_at":"2026-05-18T00:47:24.797206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00316v1","created_at":"2026-05-18T00:47:24.797206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00316","created_at":"2026-05-18T00:47:24.797206+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAAY4CRVGDYC","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAAY4CRVGDYCJVM3","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAAY4CRV","created_at":"2026-05-18T12:31:28.150371+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/LAAY4CRVGDYCJVM3MVTWIXUQJW","json":"https://pith.science/pith/LAAY4CRVGDYCJVM3MVTWIXUQJW.json","graph_json":"https://pith.science/api/pith-number/LAAY4CRVGDYCJVM3MVTWIXUQJW/graph.json","events_json":"https://pith.science/api/pith-number/LAAY4CRVGDYCJVM3MVTWIXUQJW/events.json","paper":"https://pith.science/paper/LAAY4CRV"},"agent_actions":{"view_html":"https://pith.science/pith/LAAY4CRVGDYCJVM3MVTWIXUQJW","download_json":"https://pith.science/pith/LAAY4CRVGDYCJVM3MVTWIXUQJW.json","view_paper":"https://pith.science/paper/LAAY4CRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00316&json=true","fetch_graph":"https://pith.science/api/pith-number/LAAY4CRVGDYCJVM3MVTWIXUQJW/graph.json","fetch_events":"https://pith.science/api/pith-number/LAAY4CRVGDYCJVM3MVTWIXUQJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAAY4CRVGDYCJVM3MVTWIXUQJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAAY4CRVGDYCJVM3MVTWIXUQJW/action/storage_attestation","attest_author":"https://pith.science/pith/LAAY4CRVGDYCJVM3MVTWIXUQJW/action/author_attestation","sign_citation":"https://pith.science/pith/LAAY4CRVGDYCJVM3MVTWIXUQJW/action/citation_signature","submit_replication":"https://pith.science/pith/LAAY4CRVGDYCJVM3MVTWIXUQJW/action/replication_record"}},"created_at":"2026-05-18T00:47:24.797206+00:00","updated_at":"2026-05-18T00:47:24.797206+00:00"}