{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HMFAD5EJFHQYS2TCED6VYL7CSR","short_pith_number":"pith:HMFAD5EJ","schema_version":"1.0","canonical_sha256":"3b0a01f48929e1896a6220fd5c2fe294657e0ef2f6637d96f16e02adc53a5106","source":{"kind":"arxiv","id":"1403.5546","version":1},"attestation_state":"computed","paper":{"title":"Disjoint compatibility graph of non-crossing matchings of points in convex position","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Andrei Asinowski, Oswin Aichholzer, Tillmann Miltzow","submitted_at":"2014-03-21T19:10:28Z","abstract_excerpt":"Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have common edges, and no edge of $M$ crosses an edge of $M'$. Denote by $\\mathrm{DCM}_k$ the graph whose vertices correspond to such matchings, and two vertices are adjacent if and only if the corresponding matchings are disjoint compatible. We show that for each $k \\geq 9$, the connected components of $\\mathrm{DCM}_k$ form exactly three isomorphism classes -- n"},"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":"1403.5546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-21T19:10:28Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"f7a1980274f0c061ad4f3d45502b6b7aefd1973ab5cf2d95de9c63f451a8ffcd","abstract_canon_sha256":"82fcef478a652f3fe8c0e64f519b9639c0fe922f97ebc65ed01e777016b7a40f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:50.272332Z","signature_b64":"0c6UMR2KNvv9NHy7Al0YEaH3X0VEvAPP0p/lPqyTzg/ph/FbEaGC+ooeioCB5cvW4q0u+dLSWLxhI4MlZTisBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b0a01f48929e1896a6220fd5c2fe294657e0ef2f6637d96f16e02adc53a5106","last_reissued_at":"2026-05-18T02:55:50.271619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:50.271619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjoint compatibility graph of non-crossing matchings of points in convex position","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Andrei Asinowski, Oswin Aichholzer, Tillmann Miltzow","submitted_at":"2014-03-21T19:10:28Z","abstract_excerpt":"Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have common edges, and no edge of $M$ crosses an edge of $M'$. Denote by $\\mathrm{DCM}_k$ the graph whose vertices correspond to such matchings, and two vertices are adjacent if and only if the corresponding matchings are disjoint compatible. We show that for each $k \\geq 9$, the connected components of $\\mathrm{DCM}_k$ form exactly three isomorphism classes -- n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5546","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":"1403.5546","created_at":"2026-05-18T02:55:50.271718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5546v1","created_at":"2026-05-18T02:55:50.271718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5546","created_at":"2026-05-18T02:55:50.271718+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMFAD5EJFHQY","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMFAD5EJFHQYS2TC","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMFAD5EJ","created_at":"2026-05-18T12:28:30.664211+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/HMFAD5EJFHQYS2TCED6VYL7CSR","json":"https://pith.science/pith/HMFAD5EJFHQYS2TCED6VYL7CSR.json","graph_json":"https://pith.science/api/pith-number/HMFAD5EJFHQYS2TCED6VYL7CSR/graph.json","events_json":"https://pith.science/api/pith-number/HMFAD5EJFHQYS2TCED6VYL7CSR/events.json","paper":"https://pith.science/paper/HMFAD5EJ"},"agent_actions":{"view_html":"https://pith.science/pith/HMFAD5EJFHQYS2TCED6VYL7CSR","download_json":"https://pith.science/pith/HMFAD5EJFHQYS2TCED6VYL7CSR.json","view_paper":"https://pith.science/paper/HMFAD5EJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5546&json=true","fetch_graph":"https://pith.science/api/pith-number/HMFAD5EJFHQYS2TCED6VYL7CSR/graph.json","fetch_events":"https://pith.science/api/pith-number/HMFAD5EJFHQYS2TCED6VYL7CSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMFAD5EJFHQYS2TCED6VYL7CSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMFAD5EJFHQYS2TCED6VYL7CSR/action/storage_attestation","attest_author":"https://pith.science/pith/HMFAD5EJFHQYS2TCED6VYL7CSR/action/author_attestation","sign_citation":"https://pith.science/pith/HMFAD5EJFHQYS2TCED6VYL7CSR/action/citation_signature","submit_replication":"https://pith.science/pith/HMFAD5EJFHQYS2TCED6VYL7CSR/action/replication_record"}},"created_at":"2026-05-18T02:55:50.271718+00:00","updated_at":"2026-05-18T02:55:50.271718+00:00"}