{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:G6S2JFPCQ7635R3OMKFK46UT6W","short_pith_number":"pith:G6S2JFPC","canonical_record":{"source":{"id":"0806.0920","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-06-05T09:31:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c32ed5b7db9f16aba1d35d173413d1adeb367aadef86adfc2f7df73a6fa1cfa3","abstract_canon_sha256":"df3e0a6604b3e432c774ecc2fd3da28dcb49098b21be2cfb78ab404dfae25ae5"},"schema_version":"1.0"},"canonical_sha256":"37a5a495e287fdbec76e628aae7a93f5acde6485f4374fb27719a5df3a74387c","source":{"kind":"arxiv","id":"0806.0920","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.0920","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"0806.0920v3","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0920","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"G6S2JFPCQ763","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"G6S2JFPCQ7635R3O","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"G6S2JFPC","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:G6S2JFPCQ7635R3OMKFK46UT6W","target":"record","payload":{"canonical_record":{"source":{"id":"0806.0920","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-06-05T09:31:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c32ed5b7db9f16aba1d35d173413d1adeb367aadef86adfc2f7df73a6fa1cfa3","abstract_canon_sha256":"df3e0a6604b3e432c774ecc2fd3da28dcb49098b21be2cfb78ab404dfae25ae5"},"schema_version":"1.0"},"canonical_sha256":"37a5a495e287fdbec76e628aae7a93f5acde6485f4374fb27719a5df3a74387c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:54.807290Z","signature_b64":"cCXZ9SMQA9lMo+GfP2v2mgWS7DfIeQNOTHjIWp3trmhPMpv7YXYlKhio/4GTnXQ/9FZ3lyvG+M/MOajIhIxeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37a5a495e287fdbec76e628aae7a93f5acde6485f4374fb27719a5df3a74387c","last_reissued_at":"2026-05-18T04:40:54.806773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:54.806773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.0920","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-18T04:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M12XnSg22OGIEA9EKuUBqQVE0YCVf6xbcDkyreHsXdgUxnkO3WLd9ZMk+4A0OJRtLonvFZseCqcRneM2RhQqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T22:28:44.629185Z"},"content_sha256":"c2c2632b8ec3650e5b4f0aa4ec8c887902649b44e449eaa1a33031fce0232bf0","schema_version":"1.0","event_id":"sha256:c2c2632b8ec3650e5b4f0aa4ec8c887902649b44e449eaa1a33031fce0232bf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:G6S2JFPCQ7635R3OMKFK46UT6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Jaroslaw Byrka, Kevin Buchin, Maike Buchin, Martin N\\\"ollenburg, Rodrigo I. Silveira, Yoshio Okamoto","submitted_at":"2008-06-05T09:31:57Z","abstract_excerpt":"A \\emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a tanglegram with the minimum number of crossings is NP-hard and that the problem is fixed-parameter tractable with respect to that number.\n  We prove that under the Unique Games Conjecture there is no constant-factor appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0920","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-18T04:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8e/8wdFf9h62v8slAme1pEYs0eV22CQ9yu2bourwpjGxsOgpvO+qOajPVCM7XPAbGn9rgIxIP7Gv+kcV6V2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T22:28:44.629865Z"},"content_sha256":"e530af0efb9a60955dff32d56e916a9b55c97ad341c2f8e4c52ce2e633bb6c6d","schema_version":"1.0","event_id":"sha256:e530af0efb9a60955dff32d56e916a9b55c97ad341c2f8e4c52ce2e633bb6c6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6S2JFPCQ7635R3OMKFK46UT6W/bundle.json","state_url":"https://pith.science/pith/G6S2JFPCQ7635R3OMKFK46UT6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6S2JFPCQ7635R3OMKFK46UT6W/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-20T22:28:44Z","links":{"resolver":"https://pith.science/pith/G6S2JFPCQ7635R3OMKFK46UT6W","bundle":"https://pith.science/pith/G6S2JFPCQ7635R3OMKFK46UT6W/bundle.json","state":"https://pith.science/pith/G6S2JFPCQ7635R3OMKFK46UT6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6S2JFPCQ7635R3OMKFK46UT6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:G6S2JFPCQ7635R3OMKFK46UT6W","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":"df3e0a6604b3e432c774ecc2fd3da28dcb49098b21be2cfb78ab404dfae25ae5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-06-05T09:31:57Z","title_canon_sha256":"c32ed5b7db9f16aba1d35d173413d1adeb367aadef86adfc2f7df73a6fa1cfa3"},"schema_version":"1.0","source":{"id":"0806.0920","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.0920","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"0806.0920v3","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0920","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"G6S2JFPCQ763","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"G6S2JFPCQ7635R3O","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"G6S2JFPC","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:e530af0efb9a60955dff32d56e916a9b55c97ad341c2f8e4c52ce2e633bb6c6d","target":"graph","created_at":"2026-05-18T04:40:54Z","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":"A \\emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a tanglegram with the minimum number of crossings is NP-hard and that the problem is fixed-parameter tractable with respect to that number.\n  We prove that under the Unique Games Conjecture there is no constant-factor appr","authors_text":"Alexander Wolff, Jaroslaw Byrka, Kevin Buchin, Maike Buchin, Martin N\\\"ollenburg, Rodrigo I. Silveira, Yoshio Okamoto","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-06-05T09:31:57Z","title":"Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0920","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:c2c2632b8ec3650e5b4f0aa4ec8c887902649b44e449eaa1a33031fce0232bf0","target":"record","created_at":"2026-05-18T04:40:54Z","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":"df3e0a6604b3e432c774ecc2fd3da28dcb49098b21be2cfb78ab404dfae25ae5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-06-05T09:31:57Z","title_canon_sha256":"c32ed5b7db9f16aba1d35d173413d1adeb367aadef86adfc2f7df73a6fa1cfa3"},"schema_version":"1.0","source":{"id":"0806.0920","kind":"arxiv","version":3}},"canonical_sha256":"37a5a495e287fdbec76e628aae7a93f5acde6485f4374fb27719a5df3a74387c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37a5a495e287fdbec76e628aae7a93f5acde6485f4374fb27719a5df3a74387c","first_computed_at":"2026-05-18T04:40:54.806773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:54.806773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cCXZ9SMQA9lMo+GfP2v2mgWS7DfIeQNOTHjIWp3trmhPMpv7YXYlKhio/4GTnXQ/9FZ3lyvG+M/MOajIhIxeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:54.807290Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.0920","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2c2632b8ec3650e5b4f0aa4ec8c887902649b44e449eaa1a33031fce0232bf0","sha256:e530af0efb9a60955dff32d56e916a9b55c97ad341c2f8e4c52ce2e633bb6c6d"],"state_sha256":"1b7dc6fca6b337557e87a2ffe3851a411afa70ebc0941bcf7d33d91cffc2dc2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGN9TSi7o+mV3a9nQuwqEVFl4uoJfEiyoRwuPgz96UkPjaldxWaVnkidsdgMCYX5PclzS/ghz68xCx84V6bUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T22:28:44.633500Z","bundle_sha256":"b6d4817d057c66022ad4ff05bb74ef5dee6a4c23fd797fe166ac9c28dba50524"}}