{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MMGWWUXNOMSIE7IRW65SL63MAJ","short_pith_number":"pith:MMGWWUXN","canonical_record":{"source":{"id":"1207.2375","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-10T14:39:41Z","cross_cats_sorted":[],"title_canon_sha256":"b0f569f6a5713c51914031f1dd6df4b4480306bbfd32c14bd3405bedb5f4d384","abstract_canon_sha256":"a245ad639d7b29f17a653106a0625f1dcf34cda794bafabc22dd7a728ef4e8f1"},"schema_version":"1.0"},"canonical_sha256":"630d6b52ed7324827d11b7bb25fb6c025adc60423117ca6d6b4b4a8f1f76a59c","source":{"kind":"arxiv","id":"1207.2375","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2375","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2375v3","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2375","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"MMGWWUXNOMSI","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MMGWWUXNOMSIE7IR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MMGWWUXN","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MMGWWUXNOMSIE7IRW65SL63MAJ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2375","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-10T14:39:41Z","cross_cats_sorted":[],"title_canon_sha256":"b0f569f6a5713c51914031f1dd6df4b4480306bbfd32c14bd3405bedb5f4d384","abstract_canon_sha256":"a245ad639d7b29f17a653106a0625f1dcf34cda794bafabc22dd7a728ef4e8f1"},"schema_version":"1.0"},"canonical_sha256":"630d6b52ed7324827d11b7bb25fb6c025adc60423117ca6d6b4b4a8f1f76a59c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:13.752654Z","signature_b64":"7qUvngdKoVzRkK7ZJ/9r3AEDhO05X0p0ad9Yez/GqPIop7fcFZkHjB/KVpkjFxGMP5bKTXYXcN0FyUlCsQ/6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630d6b52ed7324827d11b7bb25fb6c025adc60423117ca6d6b4b4a8f1f76a59c","last_reissued_at":"2026-05-18T03:06:13.752238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:13.752238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2375","source_version":3,"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-18T03:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ApIkBiaX86eZouCmfJxwCz12Ts/y4XumoOPuLyvV6Jp8ZucFPd/fgmM2guEharrm/N4twT90NlQG+udTEmuNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:45:51.188128Z"},"content_sha256":"ef18a6c14ed72031264d7a223a321dfe831ce8ec1219a1a1944204bcb89cec59","schema_version":"1.0","event_id":"sha256:ef18a6c14ed72031264d7a223a321dfe831ce8ec1219a1a1944204bcb89cec59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MMGWWUXNOMSIE7IRW65SL63MAJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bichromatic compatible matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Diane L. Souvaine, Greg Aloupis, Luis Barba, Stefan Langerman","submitted_at":"2012-07-10T14:39:41Z","abstract_excerpt":"For a set $R$ of $n$ red points and a set $B$ of $n$ blue points, a $BR$-matching is a non-crossing geometric perfect matching where each segment has one endpoint in $B$ and one in $R$. Two $BR$-matchings are compatible if their union is also non-crossing. We prove that, for any two distinct $BR$-matchings $M$ and $M'$, there exists a sequence of $BR$-matchings $M = M_1, ..., M_k = M'$ such that $M_{i-1} $ is compatible with $M_i$. This implies the connectivity of the compatible bichromatic matching graph containing one node for each bichromatic matching and an edge joining each pair of compat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2375","kind":"arxiv","version":3},"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-18T03:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UKfoif3QflVY5hozZHHWnFZddfmIwyh6S2UEPyQg4erL/7HZOH9IpwEm6dOGrWftRZrlohSk5dH+8ChbpCHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:45:51.188808Z"},"content_sha256":"c4fb452a9846a5343c305259184c78d00bd5cb48c80e48331ec9062d7b4e2afd","schema_version":"1.0","event_id":"sha256:c4fb452a9846a5343c305259184c78d00bd5cb48c80e48331ec9062d7b4e2afd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMGWWUXNOMSIE7IRW65SL63MAJ/bundle.json","state_url":"https://pith.science/pith/MMGWWUXNOMSIE7IRW65SL63MAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMGWWUXNOMSIE7IRW65SL63MAJ/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-26T15:45:51Z","links":{"resolver":"https://pith.science/pith/MMGWWUXNOMSIE7IRW65SL63MAJ","bundle":"https://pith.science/pith/MMGWWUXNOMSIE7IRW65SL63MAJ/bundle.json","state":"https://pith.science/pith/MMGWWUXNOMSIE7IRW65SL63MAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMGWWUXNOMSIE7IRW65SL63MAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MMGWWUXNOMSIE7IRW65SL63MAJ","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":"a245ad639d7b29f17a653106a0625f1dcf34cda794bafabc22dd7a728ef4e8f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-10T14:39:41Z","title_canon_sha256":"b0f569f6a5713c51914031f1dd6df4b4480306bbfd32c14bd3405bedb5f4d384"},"schema_version":"1.0","source":{"id":"1207.2375","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2375","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2375v3","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2375","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"MMGWWUXNOMSI","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MMGWWUXNOMSIE7IR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MMGWWUXN","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:c4fb452a9846a5343c305259184c78d00bd5cb48c80e48331ec9062d7b4e2afd","target":"graph","created_at":"2026-05-18T03:06:13Z","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":"For a set $R$ of $n$ red points and a set $B$ of $n$ blue points, a $BR$-matching is a non-crossing geometric perfect matching where each segment has one endpoint in $B$ and one in $R$. Two $BR$-matchings are compatible if their union is also non-crossing. We prove that, for any two distinct $BR$-matchings $M$ and $M'$, there exists a sequence of $BR$-matchings $M = M_1, ..., M_k = M'$ such that $M_{i-1} $ is compatible with $M_i$. This implies the connectivity of the compatible bichromatic matching graph containing one node for each bichromatic matching and an edge joining each pair of compat","authors_text":"Diane L. Souvaine, Greg Aloupis, Luis Barba, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-10T14:39:41Z","title":"Bichromatic compatible matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2375","kind":"arxiv","version":3},"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:ef18a6c14ed72031264d7a223a321dfe831ce8ec1219a1a1944204bcb89cec59","target":"record","created_at":"2026-05-18T03:06:13Z","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":"a245ad639d7b29f17a653106a0625f1dcf34cda794bafabc22dd7a728ef4e8f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-10T14:39:41Z","title_canon_sha256":"b0f569f6a5713c51914031f1dd6df4b4480306bbfd32c14bd3405bedb5f4d384"},"schema_version":"1.0","source":{"id":"1207.2375","kind":"arxiv","version":3}},"canonical_sha256":"630d6b52ed7324827d11b7bb25fb6c025adc60423117ca6d6b4b4a8f1f76a59c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"630d6b52ed7324827d11b7bb25fb6c025adc60423117ca6d6b4b4a8f1f76a59c","first_computed_at":"2026-05-18T03:06:13.752238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:13.752238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7qUvngdKoVzRkK7ZJ/9r3AEDhO05X0p0ad9Yez/GqPIop7fcFZkHjB/KVpkjFxGMP5bKTXYXcN0FyUlCsQ/6Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:13.752654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2375","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef18a6c14ed72031264d7a223a321dfe831ce8ec1219a1a1944204bcb89cec59","sha256:c4fb452a9846a5343c305259184c78d00bd5cb48c80e48331ec9062d7b4e2afd"],"state_sha256":"7b6440d38b0bda5621ff6594ad84258044f26ff8a70cbbacc43f5556f35b82b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0QzLjdDxYQDNdmxc6N7LDF+rYzPvdFa/sl9y8jHmoHNHkF2Cep7hAiuhk0OUJvsVNvbco3Sn2p9t+RlPy7KDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:45:51.192448Z","bundle_sha256":"4db3c128ce749038ff9f1e48d4f9cf12133b911b545f0bf287466f423ace6095"}}