{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XRD653YEDHJYFDIZMPUNVCG575","short_pith_number":"pith:XRD653YE","schema_version":"1.0","canonical_sha256":"bc47eeef0419d3828d1963e8da88ddff6860c63a168214c4b25b55a28934e756","source":{"kind":"arxiv","id":"1209.0679","version":1},"attestation_state":"computed","paper":{"title":"Minimum Weight Euclidean t-spanner is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lilach Chaitman-Yerushalmi, Paz Carmi","submitted_at":"2012-09-04T15:54:01Z","abstract_excerpt":"Given a set P of points in the plane, an Euclidean t-spanner for P is a geometric graph that preserves the Euclidean distances between every pair of points in P up to a constant factor t. The weight of a geometric graph refers to the total length of its edges. In this paper we show that the problem of deciding whether there exists an Euclidean t-spanner, for a given set of points in the plane, of weight at most w is NP-hard for every real constant t > 1, both whether planarity of the t-spanner is required or not."},"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":"1209.0679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-04T15:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"cc99812c243b5ba93884bad363f9a0067cf316b74b042704b698b326e826b2bc","abstract_canon_sha256":"77b66a20cb8d7bc41971490d0a623578f8aef946abc9f5951dd2aaa65c84b6e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.494220Z","signature_b64":"vT9JIxWlBcagZ9z5HUuooiEO9SG3/aEjUUqPoj5evonhp/0hOqOOQljnYcKanOc/aMi7DT1kWuLF6l5l74sRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc47eeef0419d3828d1963e8da88ddff6860c63a168214c4b25b55a28934e756","last_reissued_at":"2026-05-18T03:46:17.493359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.493359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Weight Euclidean t-spanner is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lilach Chaitman-Yerushalmi, Paz Carmi","submitted_at":"2012-09-04T15:54:01Z","abstract_excerpt":"Given a set P of points in the plane, an Euclidean t-spanner for P is a geometric graph that preserves the Euclidean distances between every pair of points in P up to a constant factor t. The weight of a geometric graph refers to the total length of its edges. In this paper we show that the problem of deciding whether there exists an Euclidean t-spanner, for a given set of points in the plane, of weight at most w is NP-hard for every real constant t > 1, both whether planarity of the t-spanner is required or not."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0679","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":"1209.0679","created_at":"2026-05-18T03:46:17.493487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0679v1","created_at":"2026-05-18T03:46:17.493487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0679","created_at":"2026-05-18T03:46:17.493487+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRD653YEDHJY","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRD653YEDHJYFDIZ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRD653YE","created_at":"2026-05-18T12:27:27.928770+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/XRD653YEDHJYFDIZMPUNVCG575","json":"https://pith.science/pith/XRD653YEDHJYFDIZMPUNVCG575.json","graph_json":"https://pith.science/api/pith-number/XRD653YEDHJYFDIZMPUNVCG575/graph.json","events_json":"https://pith.science/api/pith-number/XRD653YEDHJYFDIZMPUNVCG575/events.json","paper":"https://pith.science/paper/XRD653YE"},"agent_actions":{"view_html":"https://pith.science/pith/XRD653YEDHJYFDIZMPUNVCG575","download_json":"https://pith.science/pith/XRD653YEDHJYFDIZMPUNVCG575.json","view_paper":"https://pith.science/paper/XRD653YE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0679&json=true","fetch_graph":"https://pith.science/api/pith-number/XRD653YEDHJYFDIZMPUNVCG575/graph.json","fetch_events":"https://pith.science/api/pith-number/XRD653YEDHJYFDIZMPUNVCG575/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRD653YEDHJYFDIZMPUNVCG575/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRD653YEDHJYFDIZMPUNVCG575/action/storage_attestation","attest_author":"https://pith.science/pith/XRD653YEDHJYFDIZMPUNVCG575/action/author_attestation","sign_citation":"https://pith.science/pith/XRD653YEDHJYFDIZMPUNVCG575/action/citation_signature","submit_replication":"https://pith.science/pith/XRD653YEDHJYFDIZMPUNVCG575/action/replication_record"}},"created_at":"2026-05-18T03:46:17.493487+00:00","updated_at":"2026-05-18T03:46:17.493487+00:00"}