{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UWGOJGBIRMZU7PM72W7L6QK7OX","short_pith_number":"pith:UWGOJGBI","canonical_record":{"source":{"id":"1611.01661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-05T15:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"cae85fd6ac2a695c31a70fdab948ad14f6a9eab95f165d2db95576c2431e037e","abstract_canon_sha256":"2df26cac0b46210ef232f941eabaeb021ff6ff02224dce2c20dc4724702d3331"},"schema_version":"1.0"},"canonical_sha256":"a58ce498288b334fbd9fd5bebf415f75cc4f44f8c0f676313dad8baf1806f61a","source":{"kind":"arxiv","id":"1611.01661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01661","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01661v1","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01661","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"UWGOJGBIRMZU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UWGOJGBIRMZU7PM7","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UWGOJGBI","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UWGOJGBIRMZU7PM72W7L6QK7OX","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-05T15:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"cae85fd6ac2a695c31a70fdab948ad14f6a9eab95f165d2db95576c2431e037e","abstract_canon_sha256":"2df26cac0b46210ef232f941eabaeb021ff6ff02224dce2c20dc4724702d3331"},"schema_version":"1.0"},"canonical_sha256":"a58ce498288b334fbd9fd5bebf415f75cc4f44f8c0f676313dad8baf1806f61a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:04.732269Z","signature_b64":"9H7mQinuayqmQUUQG4gblZ9OcrjkuZSuqszHd4JJ0hMtC1de/KrI6LJz5nxxbSNRcdEsYSdQEubve73P4zVNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a58ce498288b334fbd9fd5bebf415f75cc4f44f8c0f676313dad8baf1806f61a","last_reissued_at":"2026-05-18T01:00:04.731825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:04.731825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01661","source_version":1,"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-18T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3j71X6fMxHc4StSJha2fwC24BkRP0D2aNq1581s0eplaBIaDKl7vRFAK1twiukswm2DQIW674jo4ktAh2yhhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:49:09.186302Z"},"content_sha256":"51f85840cd725ba13f282810cce27508d34c904bb2b0d956e331ea31372c9bb5","schema_version":"1.0","event_id":"sha256:51f85840cd725ba13f282810cce27508d34c904bb2b0d956e331ea31372c9bb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UWGOJGBIRMZU7PM72W7L6QK7OX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning Trees in Multipartite Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, David Eppstein, Michiel Smid, Pat Morin, Prosenjit Bose","submitted_at":"2016-11-05T15:54:46Z","abstract_excerpt":"Let $R$ and $B$ be two disjoint sets of points in the plane where the points of $R$ are colored red and the points of $B$ are colored blue, and let $n=|R\\cup B|$. A bichromatic spanning tree is a spanning tree in the complete bipartite geometric graph with bipartition $(R,B)$. The minimum (respectively maximum) bichromatic spanning tree problem is the problem of computing a bichromatic spanning tree of minimum (respectively maximum) total edge length.\n  1. We present a simple algorithm that solves the minimum bichromatic spanning tree problem in $O(n\\log^3 n)$ time. This algorithm can easily b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01661","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"},"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-18T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpT6xTT7I1H8DSZHKvuOno0XQ1k2vISugYkAFgC9eV740Vg4fFFUF5wzCmF9cYcCmkSDswoLkOuXF2RiXMz7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:49:09.186681Z"},"content_sha256":"a193bea21531844fbce81f6a0fe33e01128a28c184665c6e4929754d5e8e0b1e","schema_version":"1.0","event_id":"sha256:a193bea21531844fbce81f6a0fe33e01128a28c184665c6e4929754d5e8e0b1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWGOJGBIRMZU7PM72W7L6QK7OX/bundle.json","state_url":"https://pith.science/pith/UWGOJGBIRMZU7PM72W7L6QK7OX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWGOJGBIRMZU7PM72W7L6QK7OX/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-30T11:49:09Z","links":{"resolver":"https://pith.science/pith/UWGOJGBIRMZU7PM72W7L6QK7OX","bundle":"https://pith.science/pith/UWGOJGBIRMZU7PM72W7L6QK7OX/bundle.json","state":"https://pith.science/pith/UWGOJGBIRMZU7PM72W7L6QK7OX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWGOJGBIRMZU7PM72W7L6QK7OX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UWGOJGBIRMZU7PM72W7L6QK7OX","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":"2df26cac0b46210ef232f941eabaeb021ff6ff02224dce2c20dc4724702d3331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-05T15:54:46Z","title_canon_sha256":"cae85fd6ac2a695c31a70fdab948ad14f6a9eab95f165d2db95576c2431e037e"},"schema_version":"1.0","source":{"id":"1611.01661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01661","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01661v1","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01661","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"UWGOJGBIRMZU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UWGOJGBIRMZU7PM7","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UWGOJGBI","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:a193bea21531844fbce81f6a0fe33e01128a28c184665c6e4929754d5e8e0b1e","target":"graph","created_at":"2026-05-18T01:00:04Z","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":"Let $R$ and $B$ be two disjoint sets of points in the plane where the points of $R$ are colored red and the points of $B$ are colored blue, and let $n=|R\\cup B|$. A bichromatic spanning tree is a spanning tree in the complete bipartite geometric graph with bipartition $(R,B)$. The minimum (respectively maximum) bichromatic spanning tree problem is the problem of computing a bichromatic spanning tree of minimum (respectively maximum) total edge length.\n  1. We present a simple algorithm that solves the minimum bichromatic spanning tree problem in $O(n\\log^3 n)$ time. This algorithm can easily b","authors_text":"Ahmad Biniaz, Anil Maheshwari, David Eppstein, Michiel Smid, Pat Morin, Prosenjit Bose","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-05T15:54:46Z","title":"Spanning Trees in Multipartite Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01661","kind":"arxiv","version":1},"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:51f85840cd725ba13f282810cce27508d34c904bb2b0d956e331ea31372c9bb5","target":"record","created_at":"2026-05-18T01:00:04Z","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":"2df26cac0b46210ef232f941eabaeb021ff6ff02224dce2c20dc4724702d3331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-05T15:54:46Z","title_canon_sha256":"cae85fd6ac2a695c31a70fdab948ad14f6a9eab95f165d2db95576c2431e037e"},"schema_version":"1.0","source":{"id":"1611.01661","kind":"arxiv","version":1}},"canonical_sha256":"a58ce498288b334fbd9fd5bebf415f75cc4f44f8c0f676313dad8baf1806f61a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a58ce498288b334fbd9fd5bebf415f75cc4f44f8c0f676313dad8baf1806f61a","first_computed_at":"2026-05-18T01:00:04.731825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:04.731825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9H7mQinuayqmQUUQG4gblZ9OcrjkuZSuqszHd4JJ0hMtC1de/KrI6LJz5nxxbSNRcdEsYSdQEubve73P4zVNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:04.732269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51f85840cd725ba13f282810cce27508d34c904bb2b0d956e331ea31372c9bb5","sha256:a193bea21531844fbce81f6a0fe33e01128a28c184665c6e4929754d5e8e0b1e"],"state_sha256":"529b696c3d46efe212dae876d3802c686374cc262a2b4e772738f7698ac10340"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYOVIHWPwoP6c3VUZlV9vxXLHPX9XAnlOxW0/RCvVZ+Ds3814VT0+dDOUoqBWSITUeF2Gx/rlsFb4jcsi2lDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:49:09.189472Z","bundle_sha256":"7bafe258b0547da87c64dc534e8c7df7b1abf1b09ba80e18f772898854724fd6"}}