{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RJ3AXKPQZYQNABR4GDR6IUBEOS","short_pith_number":"pith:RJ3AXKPQ","schema_version":"1.0","canonical_sha256":"8a760ba9f0ce20d0063c30e3e4502474969edc97f88de572d1217322328a58b6","source":{"kind":"arxiv","id":"1211.2734","version":1},"attestation_state":"computed","paper":{"title":"Fixed-Orientation Equilateral Triangle Matching of Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Jasine Babu, Michiel Smid","submitted_at":"2012-11-12T19:02:06Z","abstract_excerpt":"Given a point set $P$ and a class $\\mathcal{C}$ of geometric objects, $G_\\mathcal{C}(P)$ is a geometric graph with vertex set $P$ such that any two vertices $p$ and $q$ are adjacent if and only if there is some $C \\in \\mathcal{C}$ containing both $p$ and $q$ but no other points from $P$. We study $G_{\\bigtriangledown}(P)$ graphs where $\\bigtriangledown$ is the class of downward equilateral triangles (ie. equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to "},"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":"1211.2734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-11-12T19:02:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"58dbbc1eec9d1a2078f5893c085a7f62715f2ad36355b5504f59416bd410e1c3","abstract_canon_sha256":"b2adaaa9f6aaa744a17450eab8010c95edebcc9bdb7c305b4363169db5a9a511"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:02.009259Z","signature_b64":"iLlBwm3e0EvqdLLhxByB4zjoRaienDEaKSqSsawT73uWGoSZ4Pjv4FLIARK3tOZNEdrfiGnW4I9mzQ4EyYS+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a760ba9f0ce20d0063c30e3e4502474969edc97f88de572d1217322328a58b6","last_reissued_at":"2026-05-18T03:41:02.008505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:02.008505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-Orientation Equilateral Triangle Matching of Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Jasine Babu, Michiel Smid","submitted_at":"2012-11-12T19:02:06Z","abstract_excerpt":"Given a point set $P$ and a class $\\mathcal{C}$ of geometric objects, $G_\\mathcal{C}(P)$ is a geometric graph with vertex set $P$ such that any two vertices $p$ and $q$ are adjacent if and only if there is some $C \\in \\mathcal{C}$ containing both $p$ and $q$ but no other points from $P$. We study $G_{\\bigtriangledown}(P)$ graphs where $\\bigtriangledown$ is the class of downward equilateral triangles (ie. equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2734","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":"1211.2734","created_at":"2026-05-18T03:41:02.008634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2734v1","created_at":"2026-05-18T03:41:02.008634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2734","created_at":"2026-05-18T03:41:02.008634+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJ3AXKPQZYQN","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJ3AXKPQZYQNABR4","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJ3AXKPQ","created_at":"2026-05-18T12:27:20.899486+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/RJ3AXKPQZYQNABR4GDR6IUBEOS","json":"https://pith.science/pith/RJ3AXKPQZYQNABR4GDR6IUBEOS.json","graph_json":"https://pith.science/api/pith-number/RJ3AXKPQZYQNABR4GDR6IUBEOS/graph.json","events_json":"https://pith.science/api/pith-number/RJ3AXKPQZYQNABR4GDR6IUBEOS/events.json","paper":"https://pith.science/paper/RJ3AXKPQ"},"agent_actions":{"view_html":"https://pith.science/pith/RJ3AXKPQZYQNABR4GDR6IUBEOS","download_json":"https://pith.science/pith/RJ3AXKPQZYQNABR4GDR6IUBEOS.json","view_paper":"https://pith.science/paper/RJ3AXKPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2734&json=true","fetch_graph":"https://pith.science/api/pith-number/RJ3AXKPQZYQNABR4GDR6IUBEOS/graph.json","fetch_events":"https://pith.science/api/pith-number/RJ3AXKPQZYQNABR4GDR6IUBEOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJ3AXKPQZYQNABR4GDR6IUBEOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJ3AXKPQZYQNABR4GDR6IUBEOS/action/storage_attestation","attest_author":"https://pith.science/pith/RJ3AXKPQZYQNABR4GDR6IUBEOS/action/author_attestation","sign_citation":"https://pith.science/pith/RJ3AXKPQZYQNABR4GDR6IUBEOS/action/citation_signature","submit_replication":"https://pith.science/pith/RJ3AXKPQZYQNABR4GDR6IUBEOS/action/replication_record"}},"created_at":"2026-05-18T03:41:02.008634+00:00","updated_at":"2026-05-18T03:41:02.008634+00:00"}