{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CQFFCUAJB4H253KHCNNBQAC2NG","short_pith_number":"pith:CQFFCUAJ","schema_version":"1.0","canonical_sha256":"140a5150090f0faeed47135a18005a698787b88adfc4ce9b733ae8b9c037792b","source":{"kind":"arxiv","id":"1312.2819","version":1},"attestation_state":"computed","paper":{"title":"Covering Partial Cubes with Zones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jean Cardinal, Stefan Felsner","submitted_at":"2013-12-10T14:54:47Z","abstract_excerpt":"A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of a hypercube in which the graph can be embedded. We consider the problem of covering the vertices of a partial cube with the minimum number of zones. The problem admits several special cases, among which are the problem of covering the cells of a line arrangement with a minimum number of lines, and the problem of finding a minimum-size fibre in a bipartite po"},"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":"1312.2819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-10T14:54:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8525d263bbb078ec1a4bb7dd578828785f15dd022052ab486fe09aeb96df77be","abstract_canon_sha256":"447eaa11bde4fda480e4d317f8bbca7f21458cb65c142d6d2e6eff6553dcdc4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:08.350968Z","signature_b64":"6PNkVLa6xhoGkZATF5MwmpSdykVxH4alf+fSSD28ao41myMGV5e64qswsp8MQnidMjV98MkiGew3aSKQdAk/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"140a5150090f0faeed47135a18005a698787b88adfc4ce9b733ae8b9c037792b","last_reissued_at":"2026-05-18T03:05:08.350398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:08.350398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering Partial Cubes with Zones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jean Cardinal, Stefan Felsner","submitted_at":"2013-12-10T14:54:47Z","abstract_excerpt":"A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of a hypercube in which the graph can be embedded. We consider the problem of covering the vertices of a partial cube with the minimum number of zones. The problem admits several special cases, among which are the problem of covering the cells of a line arrangement with a minimum number of lines, and the problem of finding a minimum-size fibre in a bipartite po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2819","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":"1312.2819","created_at":"2026-05-18T03:05:08.350514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2819v1","created_at":"2026-05-18T03:05:08.350514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2819","created_at":"2026-05-18T03:05:08.350514+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQFFCUAJB4H2","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQFFCUAJB4H253KH","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQFFCUAJ","created_at":"2026-05-18T12:27:40.988391+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/CQFFCUAJB4H253KHCNNBQAC2NG","json":"https://pith.science/pith/CQFFCUAJB4H253KHCNNBQAC2NG.json","graph_json":"https://pith.science/api/pith-number/CQFFCUAJB4H253KHCNNBQAC2NG/graph.json","events_json":"https://pith.science/api/pith-number/CQFFCUAJB4H253KHCNNBQAC2NG/events.json","paper":"https://pith.science/paper/CQFFCUAJ"},"agent_actions":{"view_html":"https://pith.science/pith/CQFFCUAJB4H253KHCNNBQAC2NG","download_json":"https://pith.science/pith/CQFFCUAJB4H253KHCNNBQAC2NG.json","view_paper":"https://pith.science/paper/CQFFCUAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2819&json=true","fetch_graph":"https://pith.science/api/pith-number/CQFFCUAJB4H253KHCNNBQAC2NG/graph.json","fetch_events":"https://pith.science/api/pith-number/CQFFCUAJB4H253KHCNNBQAC2NG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQFFCUAJB4H253KHCNNBQAC2NG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQFFCUAJB4H253KHCNNBQAC2NG/action/storage_attestation","attest_author":"https://pith.science/pith/CQFFCUAJB4H253KHCNNBQAC2NG/action/author_attestation","sign_citation":"https://pith.science/pith/CQFFCUAJB4H253KHCNNBQAC2NG/action/citation_signature","submit_replication":"https://pith.science/pith/CQFFCUAJB4H253KHCNNBQAC2NG/action/replication_record"}},"created_at":"2026-05-18T03:05:08.350514+00:00","updated_at":"2026-05-18T03:05:08.350514+00:00"}