{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5P33AJTNBEZFUR7EUJK3H4TCMQ","short_pith_number":"pith:5P33AJTN","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"},"canonical_sha256":"ebf7b0266d09325a47e4a255b3f2626431e507d4a00d6accea6497ccdd7cbbb7","source":{"kind":"arxiv","id":"1611.10058","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10058","created_at":"2026-05-18T00:35:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10058v2","created_at":"2026-05-18T00:35:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10058","created_at":"2026-05-18T00:35:18Z"},{"alias_kind":"pith_short_12","alias_value":"5P33AJTNBEZF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5P33AJTNBEZFUR7E","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5P33AJTN","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5P33AJTNBEZFUR7EUJK3H4TCMQ","target":"record","payload":{"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"},"canonical_sha256":"ebf7b0266d09325a47e4a255b3f2626431e507d4a00d6accea6497ccdd7cbbb7","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"},"source_kind":"arxiv","source_id":"1611.10058","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2qsaM7afyW1jdgegOVs7LP4wOqkWa1K7yq2sZVGYOQp4eORb/GN8zqLX2BLVfPNNdUTHzMRHKAY/vl4as61Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:34:13.663290Z"},"content_sha256":"05648518a28a973acaa027919cf9c5bd6902968dadcfce21c9ece98e9b58aa41","schema_version":"1.0","event_id":"sha256:05648518a28a973acaa027919cf9c5bd6902968dadcfce21c9ece98e9b58aa41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5P33AJTNBEZFUR7EUJK3H4TCMQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ToBSX3jEcyqEbfylLsibBlxfaF8B22fYGAifqF026ayKS5f4UECxPz2aTyTAyGrFVmFjbT9BjiOQRRYKFRmyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:34:13.663684Z"},"content_sha256":"2977c903265fc799ea408c8c605f5ae75502fea3574103eeeb6246ea63dd1353","schema_version":"1.0","event_id":"sha256:2977c903265fc799ea408c8c605f5ae75502fea3574103eeeb6246ea63dd1353"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/bundle.json","state_url":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T22:34:13Z","links":{"resolver":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ","bundle":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/bundle.json","state":"https://pith.science/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5P33AJTNBEZFUR7EUJK3H4TCMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5P33AJTNBEZFUR7EUJK3H4TCMQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8e3ee82f69fe41aa2a3fbb9b9d829d5635b55a675b8b7a000435421be2ef0f43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T09:30:21Z","title_canon_sha256":"90f42c5b78b176e5f2a4b0b0988f777360297018bf5c5d591a72f6206d1b7381"},"schema_version":"1.0","source":{"id":"1611.10058","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10058","created_at":"2026-05-18T00:35:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10058v2","created_at":"2026-05-18T00:35:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10058","created_at":"2026-05-18T00:35:18Z"},{"alias_kind":"pith_short_12","alias_value":"5P33AJTNBEZF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5P33AJTNBEZFUR7E","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5P33AJTN","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:2977c903265fc799ea408c8c605f5ae75502fea3574103eeeb6246ea63dd1353","target":"graph","created_at":"2026-05-18T00:35:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Adem Kilicman, Gek L. Chia, Hazim Michman Trao, Niran Abbas Ali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T09:30:21Z","title":"Non-Crossing Perfect Matchings and Triangle-Free Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10058","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:05648518a28a973acaa027919cf9c5bd6902968dadcfce21c9ece98e9b58aa41","target":"record","created_at":"2026-05-18T00:35:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8e3ee82f69fe41aa2a3fbb9b9d829d5635b55a675b8b7a000435421be2ef0f43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T09:30:21Z","title_canon_sha256":"90f42c5b78b176e5f2a4b0b0988f777360297018bf5c5d591a72f6206d1b7381"},"schema_version":"1.0","source":{"id":"1611.10058","kind":"arxiv","version":2}},"canonical_sha256":"ebf7b0266d09325a47e4a255b3f2626431e507d4a00d6accea6497ccdd7cbbb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebf7b0266d09325a47e4a255b3f2626431e507d4a00d6accea6497ccdd7cbbb7","first_computed_at":"2026-05-18T00:35:18.439043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:18.439043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"17/74gcqB+STqcyId6ccpKV53T+OrJXbO8JuNj7DTSsNYDnrd+YahtyEhXL4wyljaon7ORBr5+8o9O3AhrKeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:18.439597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10058","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05648518a28a973acaa027919cf9c5bd6902968dadcfce21c9ece98e9b58aa41","sha256:2977c903265fc799ea408c8c605f5ae75502fea3574103eeeb6246ea63dd1353"],"state_sha256":"5a5c04035290f9fd836b75d699800aba208976a2553a338e94a689781322a160"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqUK+EkDoTbqQ9RZ8YQw/gRoD5/FBlsQFb3v5OF9rPX2voCXs7RmIRIfYGFF1dZR6dg/z1x2bkLOEajrZOWLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:34:13.667132Z","bundle_sha256":"672fdaa1405184ccf3253764edc8966426408cce8b20d7897ebc3ee123eee9b1"}}