{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4YMVWU3PNOMMC4PT6RVKKKCFR3","short_pith_number":"pith:4YMVWU3P","schema_version":"1.0","canonical_sha256":"e6195b536f6b98c171f3f46aa528458eebc25b93b866922835b541cb9d027609","source":{"kind":"arxiv","id":"1503.04871","version":1},"attestation_state":"computed","paper":{"title":"Strong Matching of Points with Geometric Shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Michiel Smid","submitted_at":"2015-03-16T22:14:32Z","abstract_excerpt":"Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having the two points on its boundary. A matching in $G_S(P)$ is said to be $strong$, if the homothests of $S$ representing the edges of the matching, are pairwise disjoint, i.e., do not share any point in the plane. We consider the problem of computing a strong matching in $G_S(P)$, where $S$ is a diametral-disk, an equilateral-triangle, or a square. We present a"},"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":"1503.04871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-16T22:14:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bb8065c90bab1937ca56497b860952e8bc9e26926fdddffe0ed8b27f873c97ce","abstract_canon_sha256":"dfab7a293cf4f6ebe5978a81de875b716e8c8653287d3622ebffbf5dc0bb4e05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:21.370486Z","signature_b64":"m6jsag7sEI1muO2XlRjoXwTC7k4QaZbD3JmWqHUhlDr/wutb8uQg7ntBq3C4EbXC4fEAPTQBtF+Tz2+H/RPYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6195b536f6b98c171f3f46aa528458eebc25b93b866922835b541cb9d027609","last_reissued_at":"2026-05-18T02:22:21.369795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:21.369795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Matching of Points with Geometric Shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Michiel Smid","submitted_at":"2015-03-16T22:14:32Z","abstract_excerpt":"Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having the two points on its boundary. A matching in $G_S(P)$ is said to be $strong$, if the homothests of $S$ representing the edges of the matching, are pairwise disjoint, i.e., do not share any point in the plane. We consider the problem of computing a strong matching in $G_S(P)$, where $S$ is a diametral-disk, an equilateral-triangle, or a square. We present a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04871","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":"1503.04871","created_at":"2026-05-18T02:22:21.369967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04871v1","created_at":"2026-05-18T02:22:21.369967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04871","created_at":"2026-05-18T02:22:21.369967+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YMVWU3PNOMM","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YMVWU3PNOMMC4PT","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YMVWU3P","created_at":"2026-05-18T12:29:05.191682+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/4YMVWU3PNOMMC4PT6RVKKKCFR3","json":"https://pith.science/pith/4YMVWU3PNOMMC4PT6RVKKKCFR3.json","graph_json":"https://pith.science/api/pith-number/4YMVWU3PNOMMC4PT6RVKKKCFR3/graph.json","events_json":"https://pith.science/api/pith-number/4YMVWU3PNOMMC4PT6RVKKKCFR3/events.json","paper":"https://pith.science/paper/4YMVWU3P"},"agent_actions":{"view_html":"https://pith.science/pith/4YMVWU3PNOMMC4PT6RVKKKCFR3","download_json":"https://pith.science/pith/4YMVWU3PNOMMC4PT6RVKKKCFR3.json","view_paper":"https://pith.science/paper/4YMVWU3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04871&json=true","fetch_graph":"https://pith.science/api/pith-number/4YMVWU3PNOMMC4PT6RVKKKCFR3/graph.json","fetch_events":"https://pith.science/api/pith-number/4YMVWU3PNOMMC4PT6RVKKKCFR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YMVWU3PNOMMC4PT6RVKKKCFR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YMVWU3PNOMMC4PT6RVKKKCFR3/action/storage_attestation","attest_author":"https://pith.science/pith/4YMVWU3PNOMMC4PT6RVKKKCFR3/action/author_attestation","sign_citation":"https://pith.science/pith/4YMVWU3PNOMMC4PT6RVKKKCFR3/action/citation_signature","submit_replication":"https://pith.science/pith/4YMVWU3PNOMMC4PT6RVKKKCFR3/action/replication_record"}},"created_at":"2026-05-18T02:22:21.369967+00:00","updated_at":"2026-05-18T02:22:21.369967+00:00"}