{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JDQPSXK2RD32KBHSLH5CNGI2KJ","short_pith_number":"pith:JDQPSXK2","schema_version":"1.0","canonical_sha256":"48e0f95d5a88f7a504f259fa26991a527744c7eb08b89efcd387739d980d549b","source":{"kind":"arxiv","id":"1205.1627","version":3},"attestation_state":"computed","paper":{"title":"Three ways to cover a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kolja Knauer, Torsten Ueckerdt","submitted_at":"2012-05-08T08:35:24Z","abstract_excerpt":"We consider the problem of covering an input graph $H$ with graphs from a fixed covering class $G$. The classical covering number of $H$ with respect to $G$ is the minimum number of graphs from $G$ needed to cover the edges of $H$ without covering non-edges of $H$. We introduce a unifying notion of three covering parameters with respect to $G$, two of which are novel concepts only considered in special cases before: the local and the folded covering number. Each parameter measures \"how far'' $H$ is from $G$ in a different way. Whereas the folded covering number has been investigated thoroughly"},"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":"1205.1627","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-08T08:35:24Z","cross_cats_sorted":[],"title_canon_sha256":"e7bfb44f343b0039101cff06209b880a3e1adfee379e4153ce21dfbbc09617af","abstract_canon_sha256":"7b27b59f4a4b1a2357f3bf014f2a52919880972e7a63181fa32c0f44129cea17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:19.380888Z","signature_b64":"MbOzT6aQ+ACRI5JQSEsAfQa4sTRYqatztb0VjCwUML+3hjPQliflDTmy40hxCVXwTz4TzShBTyEGf6lx2qGGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48e0f95d5a88f7a504f259fa26991a527744c7eb08b89efcd387739d980d549b","last_reissued_at":"2026-05-18T01:31:19.380176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:19.380176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three ways to cover a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kolja Knauer, Torsten Ueckerdt","submitted_at":"2012-05-08T08:35:24Z","abstract_excerpt":"We consider the problem of covering an input graph $H$ with graphs from a fixed covering class $G$. The classical covering number of $H$ with respect to $G$ is the minimum number of graphs from $G$ needed to cover the edges of $H$ without covering non-edges of $H$. We introduce a unifying notion of three covering parameters with respect to $G$, two of which are novel concepts only considered in special cases before: the local and the folded covering number. Each parameter measures \"how far'' $H$ is from $G$ in a different way. Whereas the folded covering number has been investigated thoroughly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1627","kind":"arxiv","version":3},"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":"1205.1627","created_at":"2026-05-18T01:31:19.380290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1627v3","created_at":"2026-05-18T01:31:19.380290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1627","created_at":"2026-05-18T01:31:19.380290+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDQPSXK2RD32","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDQPSXK2RD32KBHS","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDQPSXK2","created_at":"2026-05-18T12:27:11.947152+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/JDQPSXK2RD32KBHSLH5CNGI2KJ","json":"https://pith.science/pith/JDQPSXK2RD32KBHSLH5CNGI2KJ.json","graph_json":"https://pith.science/api/pith-number/JDQPSXK2RD32KBHSLH5CNGI2KJ/graph.json","events_json":"https://pith.science/api/pith-number/JDQPSXK2RD32KBHSLH5CNGI2KJ/events.json","paper":"https://pith.science/paper/JDQPSXK2"},"agent_actions":{"view_html":"https://pith.science/pith/JDQPSXK2RD32KBHSLH5CNGI2KJ","download_json":"https://pith.science/pith/JDQPSXK2RD32KBHSLH5CNGI2KJ.json","view_paper":"https://pith.science/paper/JDQPSXK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1627&json=true","fetch_graph":"https://pith.science/api/pith-number/JDQPSXK2RD32KBHSLH5CNGI2KJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JDQPSXK2RD32KBHSLH5CNGI2KJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDQPSXK2RD32KBHSLH5CNGI2KJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDQPSXK2RD32KBHSLH5CNGI2KJ/action/storage_attestation","attest_author":"https://pith.science/pith/JDQPSXK2RD32KBHSLH5CNGI2KJ/action/author_attestation","sign_citation":"https://pith.science/pith/JDQPSXK2RD32KBHSLH5CNGI2KJ/action/citation_signature","submit_replication":"https://pith.science/pith/JDQPSXK2RD32KBHSLH5CNGI2KJ/action/replication_record"}},"created_at":"2026-05-18T01:31:19.380290+00:00","updated_at":"2026-05-18T01:31:19.380290+00:00"}