{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BMUF4DVO3IE3XXGP2AB4VUB3EH","short_pith_number":"pith:BMUF4DVO","schema_version":"1.0","canonical_sha256":"0b285e0eaeda09bbdccfd003cad03b21f0c62a32ddd8290771479d32f61855bf","source":{"kind":"arxiv","id":"1109.2763","version":1},"attestation_state":"computed","paper":{"title":"No O(N) queries for checking if N intervals cover everything or for piercing N pairs of intervals. An O(N log N)-steps algorithm for piercing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.MG"],"primary_cat":"math.CO","authors_text":"Eliahu Levy, Meir Katchalski","submitted_at":"2011-09-13T12:50:26Z","abstract_excerpt":"The complexity of two related geometrical (indeed, combinatorial) problems is considered, measured by the number of queries needed to determine the solution. It is proved that one cannot check in a linear in N number of queries whether N intervals cover a whole interval, or whether for N pairs of intervals on two lines there is a pair of points intersecting each of these pairs of intervals (\"piercing all pairs of intervals\"). The proofs are related to examples which show that there is no \"Helly property\" here - the whole set of N may cover the whole interval (resp. may have no pair of points p"},"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":"1109.2763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-13T12:50:26Z","cross_cats_sorted":["cs.CG","math.MG"],"title_canon_sha256":"ae2975fb0885077e2433e559b900b0f5de87d489854ece4aa6b9693a3d9ff48e","abstract_canon_sha256":"f59e7019938c7ec067b6b1c99e8e89e6e14a9a4d379495f2d2b5ddde9bee5229"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:07.756152Z","signature_b64":"ln0+fl7zEC8zS4VxPDnW6UyoqZc1AX3l+vn5CSH9KQgryikACnO5HII1WLMfkpfOzug7Wa0iFZBFeTYne1miDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b285e0eaeda09bbdccfd003cad03b21f0c62a32ddd8290771479d32f61855bf","last_reissued_at":"2026-05-18T04:13:07.755458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:07.755458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"No O(N) queries for checking if N intervals cover everything or for piercing N pairs of intervals. An O(N log N)-steps algorithm for piercing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.MG"],"primary_cat":"math.CO","authors_text":"Eliahu Levy, Meir Katchalski","submitted_at":"2011-09-13T12:50:26Z","abstract_excerpt":"The complexity of two related geometrical (indeed, combinatorial) problems is considered, measured by the number of queries needed to determine the solution. It is proved that one cannot check in a linear in N number of queries whether N intervals cover a whole interval, or whether for N pairs of intervals on two lines there is a pair of points intersecting each of these pairs of intervals (\"piercing all pairs of intervals\"). The proofs are related to examples which show that there is no \"Helly property\" here - the whole set of N may cover the whole interval (resp. may have no pair of points p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2763","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":"1109.2763","created_at":"2026-05-18T04:13:07.755562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2763v1","created_at":"2026-05-18T04:13:07.755562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2763","created_at":"2026-05-18T04:13:07.755562+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMUF4DVO3IE3","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMUF4DVO3IE3XXGP","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMUF4DVO","created_at":"2026-05-18T12:26:24.575870+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/BMUF4DVO3IE3XXGP2AB4VUB3EH","json":"https://pith.science/pith/BMUF4DVO3IE3XXGP2AB4VUB3EH.json","graph_json":"https://pith.science/api/pith-number/BMUF4DVO3IE3XXGP2AB4VUB3EH/graph.json","events_json":"https://pith.science/api/pith-number/BMUF4DVO3IE3XXGP2AB4VUB3EH/events.json","paper":"https://pith.science/paper/BMUF4DVO"},"agent_actions":{"view_html":"https://pith.science/pith/BMUF4DVO3IE3XXGP2AB4VUB3EH","download_json":"https://pith.science/pith/BMUF4DVO3IE3XXGP2AB4VUB3EH.json","view_paper":"https://pith.science/paper/BMUF4DVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2763&json=true","fetch_graph":"https://pith.science/api/pith-number/BMUF4DVO3IE3XXGP2AB4VUB3EH/graph.json","fetch_events":"https://pith.science/api/pith-number/BMUF4DVO3IE3XXGP2AB4VUB3EH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMUF4DVO3IE3XXGP2AB4VUB3EH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMUF4DVO3IE3XXGP2AB4VUB3EH/action/storage_attestation","attest_author":"https://pith.science/pith/BMUF4DVO3IE3XXGP2AB4VUB3EH/action/author_attestation","sign_citation":"https://pith.science/pith/BMUF4DVO3IE3XXGP2AB4VUB3EH/action/citation_signature","submit_replication":"https://pith.science/pith/BMUF4DVO3IE3XXGP2AB4VUB3EH/action/replication_record"}},"created_at":"2026-05-18T04:13:07.755562+00:00","updated_at":"2026-05-18T04:13:07.755562+00:00"}