{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YGQXQOY5IC6WXZ5VWYOVFK5AEO","short_pith_number":"pith:YGQXQOY5","schema_version":"1.0","canonical_sha256":"c1a1783b1d40bd6be7b5b61d52aba023b8c7807b3763e993e5d4e9e9b1b10633","source":{"kind":"arxiv","id":"1412.8400","version":1},"attestation_state":"computed","paper":{"title":"Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Micha A. Perles","submitted_at":"2014-12-29T17:27:16Z","abstract_excerpt":"Let P be a finite set of points in general position in the plane. The structure of the complete graph K(P) as a geometric graph includes, for any pair [a,b],[c,d] of vertex-disjoint edges, the information whether they cross or not.\n  The simple (i.e., non-crossing) spanning trees (SSTs) of K(P) are the vertices of the so-called Geometric Tree Graph of P, G(P). Two such vertices are adjacent in G(P) if they differ in exactly two edges, i.e., if one can be obtained from the other by deleting an edge and adding another edge.\n  In this paper we show how to reconstruct from G(P) (regarded as an abs"},"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":"1412.8400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-29T17:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"6b4d7efd668b5fed4f92aba2d3e1a1effb13c666130c26ea7ae582f2c158b894","abstract_canon_sha256":"ddcaffd25e002f108434b776d76ebadf2073023afbd373c142810dfb716a2bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.363689Z","signature_b64":"iYS7WtebslZSCFKInj9lKZiG+maPk7licpBqSDggIJhRxZsENtua5y6Il4qZ8OsVHotKX9yh30qz1nfUFI+IDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a1783b1d40bd6be7b5b61d52aba023b8c7807b3763e993e5d4e9e9b1b10633","last_reissued_at":"2026-05-18T02:30:23.363154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.363154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Micha A. Perles","submitted_at":"2014-12-29T17:27:16Z","abstract_excerpt":"Let P be a finite set of points in general position in the plane. The structure of the complete graph K(P) as a geometric graph includes, for any pair [a,b],[c,d] of vertex-disjoint edges, the information whether they cross or not.\n  The simple (i.e., non-crossing) spanning trees (SSTs) of K(P) are the vertices of the so-called Geometric Tree Graph of P, G(P). Two such vertices are adjacent in G(P) if they differ in exactly two edges, i.e., if one can be obtained from the other by deleting an edge and adding another edge.\n  In this paper we show how to reconstruct from G(P) (regarded as an abs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8400","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":"1412.8400","created_at":"2026-05-18T02:30:23.363222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8400v1","created_at":"2026-05-18T02:30:23.363222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8400","created_at":"2026-05-18T02:30:23.363222+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGQXQOY5IC6W","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGQXQOY5IC6WXZ5V","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGQXQOY5","created_at":"2026-05-18T12:28:57.508820+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/YGQXQOY5IC6WXZ5VWYOVFK5AEO","json":"https://pith.science/pith/YGQXQOY5IC6WXZ5VWYOVFK5AEO.json","graph_json":"https://pith.science/api/pith-number/YGQXQOY5IC6WXZ5VWYOVFK5AEO/graph.json","events_json":"https://pith.science/api/pith-number/YGQXQOY5IC6WXZ5VWYOVFK5AEO/events.json","paper":"https://pith.science/paper/YGQXQOY5"},"agent_actions":{"view_html":"https://pith.science/pith/YGQXQOY5IC6WXZ5VWYOVFK5AEO","download_json":"https://pith.science/pith/YGQXQOY5IC6WXZ5VWYOVFK5AEO.json","view_paper":"https://pith.science/paper/YGQXQOY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8400&json=true","fetch_graph":"https://pith.science/api/pith-number/YGQXQOY5IC6WXZ5VWYOVFK5AEO/graph.json","fetch_events":"https://pith.science/api/pith-number/YGQXQOY5IC6WXZ5VWYOVFK5AEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGQXQOY5IC6WXZ5VWYOVFK5AEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGQXQOY5IC6WXZ5VWYOVFK5AEO/action/storage_attestation","attest_author":"https://pith.science/pith/YGQXQOY5IC6WXZ5VWYOVFK5AEO/action/author_attestation","sign_citation":"https://pith.science/pith/YGQXQOY5IC6WXZ5VWYOVFK5AEO/action/citation_signature","submit_replication":"https://pith.science/pith/YGQXQOY5IC6WXZ5VWYOVFK5AEO/action/replication_record"}},"created_at":"2026-05-18T02:30:23.363222+00:00","updated_at":"2026-05-18T02:30:23.363222+00:00"}