{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UG2TGZ5OSD6Q2JRYOCUFCKTGTX","short_pith_number":"pith:UG2TGZ5O","canonical_record":{"source":{"id":"1705.11116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T14:37:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1048049be8d442232a499bb4a6befef56914f8ec6eddd2072cb318175cad688a","abstract_canon_sha256":"2d3ad0ec56769813156aa6130d288829a7bbd07767969b0def13b34d2c97e088"},"schema_version":"1.0"},"canonical_sha256":"a1b53367ae90fd0d263870a8512a669dd6dfe080452c255175ee90b8e3d20fb9","source":{"kind":"arxiv","id":"1705.11116","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11116","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11116v1","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11116","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"UG2TGZ5OSD6Q","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UG2TGZ5OSD6Q2JRY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UG2TGZ5O","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UG2TGZ5OSD6Q2JRYOCUFCKTGTX","target":"record","payload":{"canonical_record":{"source":{"id":"1705.11116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T14:37:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1048049be8d442232a499bb4a6befef56914f8ec6eddd2072cb318175cad688a","abstract_canon_sha256":"2d3ad0ec56769813156aa6130d288829a7bbd07767969b0def13b34d2c97e088"},"schema_version":"1.0"},"canonical_sha256":"a1b53367ae90fd0d263870a8512a669dd6dfe080452c255175ee90b8e3d20fb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:19.240396Z","signature_b64":"CvGZz+f2JCklpUedorS3P2DPHcOZaGdGggDXGts7zUftg4lFeJeK5Mig8O0YHcbPr8zmIE77DxlUaQplXYnnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1b53367ae90fd0d263870a8512a669dd6dfe080452c255175ee90b8e3d20fb9","last_reissued_at":"2026-05-18T00:43:19.239876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:19.239876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.11116","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJrzixDban+ZYY5DA/I8nvv7jqmEmO5ba7ZWumN9zB8jURhcroMJe3uqkGUOIBc/LTAv9TKvA3aSRFpiYZMmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:24:01.680934Z"},"content_sha256":"1a1abf86c41d8bbbb120fcec11e45cd136918c08a9d3fd98ad5e91a62a1e7ac4","schema_version":"1.0","event_id":"sha256:1a1abf86c41d8bbbb120fcec11e45cd136918c08a9d3fd98ad5e91a62a1e7ac4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UG2TGZ5OSD6Q2JRYOCUFCKTGTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identification of points using disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau, Valentin Gledel","submitted_at":"2017-05-31T14:37:09Z","abstract_excerpt":"We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an instance of the test covering problem with geometric constraints on the tests. We give tight lower and upper bounds on the number of disks needed to identify any set of n points of the plane. In particular, we prove that if there are no three colinear points nor four cocyclic points, then roughly n/3 disks are enough, improving the known bound of (n+1)/2 whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11116","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJj0j2l18QOwQN3ycdRLaSbJRjHnkc8Sq94+8U6qkiXnHFg0gtE6+yJZNiQKFyy3Wy6ruiCBQXs5O6sa5r48Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:24:01.681290Z"},"content_sha256":"2e22095caac119bb2dd558966b14b0539e958714d471fc6f39288d70fe0b3dd9","schema_version":"1.0","event_id":"sha256:2e22095caac119bb2dd558966b14b0539e958714d471fc6f39288d70fe0b3dd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UG2TGZ5OSD6Q2JRYOCUFCKTGTX/bundle.json","state_url":"https://pith.science/pith/UG2TGZ5OSD6Q2JRYOCUFCKTGTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UG2TGZ5OSD6Q2JRYOCUFCKTGTX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T10:24:01Z","links":{"resolver":"https://pith.science/pith/UG2TGZ5OSD6Q2JRYOCUFCKTGTX","bundle":"https://pith.science/pith/UG2TGZ5OSD6Q2JRYOCUFCKTGTX/bundle.json","state":"https://pith.science/pith/UG2TGZ5OSD6Q2JRYOCUFCKTGTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UG2TGZ5OSD6Q2JRYOCUFCKTGTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UG2TGZ5OSD6Q2JRYOCUFCKTGTX","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":"2d3ad0ec56769813156aa6130d288829a7bbd07767969b0def13b34d2c97e088","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T14:37:09Z","title_canon_sha256":"1048049be8d442232a499bb4a6befef56914f8ec6eddd2072cb318175cad688a"},"schema_version":"1.0","source":{"id":"1705.11116","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11116","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11116v1","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11116","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"UG2TGZ5OSD6Q","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UG2TGZ5OSD6Q2JRY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UG2TGZ5O","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:2e22095caac119bb2dd558966b14b0539e958714d471fc6f39288d70fe0b3dd9","target":"graph","created_at":"2026-05-18T00:43:19Z","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":"We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an instance of the test covering problem with geometric constraints on the tests. We give tight lower and upper bounds on the number of disks needed to identify any set of n points of the plane. In particular, we prove that if there are no three colinear points nor four cocyclic points, then roughly n/3 disks are enough, improving the known bound of (n+1)/2 whe","authors_text":"Aline Parreau, Valentin Gledel","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T14:37:09Z","title":"Identification of points using disks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11116","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:1a1abf86c41d8bbbb120fcec11e45cd136918c08a9d3fd98ad5e91a62a1e7ac4","target":"record","created_at":"2026-05-18T00:43:19Z","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":"2d3ad0ec56769813156aa6130d288829a7bbd07767969b0def13b34d2c97e088","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T14:37:09Z","title_canon_sha256":"1048049be8d442232a499bb4a6befef56914f8ec6eddd2072cb318175cad688a"},"schema_version":"1.0","source":{"id":"1705.11116","kind":"arxiv","version":1}},"canonical_sha256":"a1b53367ae90fd0d263870a8512a669dd6dfe080452c255175ee90b8e3d20fb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1b53367ae90fd0d263870a8512a669dd6dfe080452c255175ee90b8e3d20fb9","first_computed_at":"2026-05-18T00:43:19.239876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:19.239876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CvGZz+f2JCklpUedorS3P2DPHcOZaGdGggDXGts7zUftg4lFeJeK5Mig8O0YHcbPr8zmIE77DxlUaQplXYnnDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:19.240396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.11116","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a1abf86c41d8bbbb120fcec11e45cd136918c08a9d3fd98ad5e91a62a1e7ac4","sha256:2e22095caac119bb2dd558966b14b0539e958714d471fc6f39288d70fe0b3dd9"],"state_sha256":"8086cd226dc3534b978a9b8f922df758bd25757ea85a0e2d60b01aa89e8eebc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OYXbCr46S2PcQe1/r7mA/YFmPQCdpOyqX/LABwilqtHEE0cmJahhq5LCY2Qxhtl84LnIdCOum353OIlJXXCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:24:01.683292Z","bundle_sha256":"45f4697837800437659cc54496a45034f6b5dcd12f6b65b3a1d7e0d5d9dcc38f"}}