{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OGYXVLZFEHTTYRN4JUSCVUKCJ7","short_pith_number":"pith:OGYXVLZF","schema_version":"1.0","canonical_sha256":"71b17aaf2521e73c45bc4d242ad1424fc8b8a21ee09be9985634f5197c2fbbf4","source":{"kind":"arxiv","id":"1703.10976","version":1},"attestation_state":"computed","paper":{"title":"Approximate Minimum Diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hamid Homapour, Masoud Seddighin, Mohammad Ghodsi","submitted_at":"2017-03-31T16:40:16Z","abstract_excerpt":"We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\\impre$ model) or a finite set of points ($\\indec$ model). Given a set of inexact points in one of $\\impre$ or $\\indec$ models, we wish to provide a lower-bound on the diameter of the real points.\n  In the first part of the paper, we focus on $\\indec$ model. We present an $O(2^{\\frac{1}{\\epsilon^d}} \\cdot \\epsilon^{-2d} \\cdot n^3 )$ time approximation algorithm of factor $(1+\\epsilo"},"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":"1703.10976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-31T16:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"a06a7886f78bea00cd316973e140fd04e12e8d7fe10f5bd936ea5beaa29b4f86","abstract_canon_sha256":"591dacc3111b64bc8717e4cc05d523c5cbba218b72202a7d3b389592b32a5c8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:32.159181Z","signature_b64":"xYEMReFwJU60+4GKY/1YfkDMreINF7q71UIBO7fzPiedIrm91DYm0tNwQyyXaa0mIIMxXuH3q9pvY3L6L0tSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71b17aaf2521e73c45bc4d242ad1424fc8b8a21ee09be9985634f5197c2fbbf4","last_reissued_at":"2026-05-18T00:47:32.158551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:32.158551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Minimum Diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hamid Homapour, Masoud Seddighin, Mohammad Ghodsi","submitted_at":"2017-03-31T16:40:16Z","abstract_excerpt":"We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\\impre$ model) or a finite set of points ($\\indec$ model). Given a set of inexact points in one of $\\impre$ or $\\indec$ models, we wish to provide a lower-bound on the diameter of the real points.\n  In the first part of the paper, we focus on $\\indec$ model. We present an $O(2^{\\frac{1}{\\epsilon^d}} \\cdot \\epsilon^{-2d} \\cdot n^3 )$ time approximation algorithm of factor $(1+\\epsilo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10976","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":"1703.10976","created_at":"2026-05-18T00:47:32.158666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10976v1","created_at":"2026-05-18T00:47:32.158666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10976","created_at":"2026-05-18T00:47:32.158666+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGYXVLZFEHTT","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGYXVLZFEHTTYRN4","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGYXVLZF","created_at":"2026-05-18T12:31:34.259226+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/OGYXVLZFEHTTYRN4JUSCVUKCJ7","json":"https://pith.science/pith/OGYXVLZFEHTTYRN4JUSCVUKCJ7.json","graph_json":"https://pith.science/api/pith-number/OGYXVLZFEHTTYRN4JUSCVUKCJ7/graph.json","events_json":"https://pith.science/api/pith-number/OGYXVLZFEHTTYRN4JUSCVUKCJ7/events.json","paper":"https://pith.science/paper/OGYXVLZF"},"agent_actions":{"view_html":"https://pith.science/pith/OGYXVLZFEHTTYRN4JUSCVUKCJ7","download_json":"https://pith.science/pith/OGYXVLZFEHTTYRN4JUSCVUKCJ7.json","view_paper":"https://pith.science/paper/OGYXVLZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10976&json=true","fetch_graph":"https://pith.science/api/pith-number/OGYXVLZFEHTTYRN4JUSCVUKCJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/OGYXVLZFEHTTYRN4JUSCVUKCJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGYXVLZFEHTTYRN4JUSCVUKCJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGYXVLZFEHTTYRN4JUSCVUKCJ7/action/storage_attestation","attest_author":"https://pith.science/pith/OGYXVLZFEHTTYRN4JUSCVUKCJ7/action/author_attestation","sign_citation":"https://pith.science/pith/OGYXVLZFEHTTYRN4JUSCVUKCJ7/action/citation_signature","submit_replication":"https://pith.science/pith/OGYXVLZFEHTTYRN4JUSCVUKCJ7/action/replication_record"}},"created_at":"2026-05-18T00:47:32.158666+00:00","updated_at":"2026-05-18T00:47:32.158666+00:00"}