{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BMUF4DVO3IE3XXGP2AB4VUB3EH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f59e7019938c7ec067b6b1c99e8e89e6e14a9a4d379495f2d2b5ddde9bee5229","cross_cats_sorted":["cs.CG","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-13T12:50:26Z","title_canon_sha256":"ae2975fb0885077e2433e559b900b0f5de87d489854ece4aa6b9693a3d9ff48e"},"schema_version":"1.0","source":{"id":"1109.2763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2763","created_at":"2026-05-18T04:13:07Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2763v1","created_at":"2026-05-18T04:13:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2763","created_at":"2026-05-18T04:13:07Z"},{"alias_kind":"pith_short_12","alias_value":"BMUF4DVO3IE3","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BMUF4DVO3IE3XXGP","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BMUF4DVO","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:9655c0abbbdaafd1e7b88cd6f15525b5204c912af6d2e443849296fdb73e3120","target":"graph","created_at":"2026-05-18T04:13:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Eliahu Levy, Meir Katchalski","cross_cats":["cs.CG","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-13T12:50:26Z","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"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2763","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b64035d4cbf406cf45918f22253575f76eeae5d79800d21639cda68f81ce2e3b","target":"record","created_at":"2026-05-18T04:13:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f59e7019938c7ec067b6b1c99e8e89e6e14a9a4d379495f2d2b5ddde9bee5229","cross_cats_sorted":["cs.CG","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-13T12:50:26Z","title_canon_sha256":"ae2975fb0885077e2433e559b900b0f5de87d489854ece4aa6b9693a3d9ff48e"},"schema_version":"1.0","source":{"id":"1109.2763","kind":"arxiv","version":1}},"canonical_sha256":"0b285e0eaeda09bbdccfd003cad03b21f0c62a32ddd8290771479d32f61855bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b285e0eaeda09bbdccfd003cad03b21f0c62a32ddd8290771479d32f61855bf","first_computed_at":"2026-05-18T04:13:07.755458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:07.755458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ln0+fl7zEC8zS4VxPDnW6UyoqZc1AX3l+vn5CSH9KQgryikACnO5HII1WLMfkpfOzug7Wa0iFZBFeTYne1miDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:07.756152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b64035d4cbf406cf45918f22253575f76eeae5d79800d21639cda68f81ce2e3b","sha256:9655c0abbbdaafd1e7b88cd6f15525b5204c912af6d2e443849296fdb73e3120"],"state_sha256":"e8c207006a714aa262391d62bd25df81452eb13c1a631e258424120bffc011cb"}