{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5P33AJTNBEZFUR7EUJK3H4TCMQ","short_pith_number":"pith:5P33AJTN","schema_version":"1.0","canonical_sha256":"ebf7b0266d09325a47e4a255b3f2626431e507d4a00d6accea6497ccdd7cbbb7","source":{"kind":"arxiv","id":"1611.10058","version":2},"attestation_state":"computed","paper":{"title":"Non-Crossing Perfect Matchings and Triangle-Free Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adem Kilicman, Gek L. Chia, Hazim Michman Trao, Niran Abbas Ali","submitted_at":"2016-11-30T09:30:21Z","abstract_excerpt":"We study extremal type problem arising from the question: What is the maximum number of edge-disjoint non-crossing perfect matchings on a set S of 2n points in the plane such that their union is a triangle-free geometric graph? We approach this problem by considering four different situations of S. In particular, in the general position, we obtain (i) a sufficient condition for the existence of n edge-disjoint non-crossing perfect matchings in the general position whose union is a maximal triangle-free geometric graph, and (ii) a lower bound on the number of edge-disjoint non-crossing perfect "},"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":"1611.10058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T09:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"90f42c5b78b176e5f2a4b0b0988f777360297018bf5c5d591a72f6206d1b7381","abstract_canon_sha256":"8e3ee82f69fe41aa2a3fbb9b9d829d5635b55a675b8b7a000435421be2ef0f43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:18.439597Z","signature_b64":"17/74gcqB+STqcyId6ccpKV53T+OrJXbO8JuNj7DTSsNYDnrd+YahtyEhXL4wyljaon7ORBr5+8o9O3AhrKeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebf7b0266d09325a47e4a255b3f2626431e507d4a00d6accea6497ccdd7cbbb7","last_reissued_at":"2026-05-18T00:35:18.439043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:18.439043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Crossing Perfect Matchings and Triangle-Free Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adem Kilicman, Gek L. Chia, Hazim Michman Trao, Niran Abbas Ali","submitted_at":"2016-11-30T09:30:21Z","abstract_excerpt":"We study extremal type problem arising from the question: What is the maximum number of edge-disjoint non-crossing perfect matchings on a set S of 2n points in the plane such that their union is a triangle-free geometric graph? We approach this problem by considering four different situations of S. In particular, in the general position, we obtain (i) a sufficient condition for the existence of n edge-disjoint non-crossing perfect matchings in the general position whose union is a maximal triangle-free geometric graph, and (ii) a lower bound on the number of edge-disjoint non-crossing perfect "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10058","kind":"arxiv","version":2},"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":"1611.10058","created_at":"2026-05-18T00:35:18.439126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.10058v2","created_at":"2026-05-18T00:35:18.439126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10058","created_at":"2026-05-18T00:35:18.439126+00:00"},{"alias_kind":"pith_short_12","alias_value":"5P33AJTNBEZF","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5P33AJTNBEZFUR7E","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5P33AJTN","created_at":"2026-05-18T12:30:01.593930+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/5P33AJTNBEZFUR7EUJK3H4TCMQ","json":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ.json","graph_json":"https://pith.science/api/pith-number/5P33AJTNBEZFUR7EUJK3H4TCMQ/graph.json","events_json":"https://pith.science/api/pith-number/5P33AJTNBEZFUR7EUJK3H4TCMQ/events.json","paper":"https://pith.science/paper/5P33AJTN"},"agent_actions":{"view_html":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ","download_json":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ.json","view_paper":"https://pith.science/paper/5P33AJTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.10058&json=true","fetch_graph":"https://pith.science/api/pith-number/5P33AJTNBEZFUR7EUJK3H4TCMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5P33AJTNBEZFUR7EUJK3H4TCMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/action/storage_attestation","attest_author":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/action/author_attestation","sign_citation":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/action/citation_signature","submit_replication":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/action/replication_record"}},"created_at":"2026-05-18T00:35:18.439126+00:00","updated_at":"2026-05-18T00:35:18.439126+00:00"}