{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IUZRWL7G6S6FTELKS6CJDVTAWZ","short_pith_number":"pith:IUZRWL7G","canonical_record":{"source":{"id":"1603.07737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T20:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"0d131d6d9e806b17e3143f5ea154ca3082d8595a64629bccab1589f96992e5db","abstract_canon_sha256":"8b7607a963fc226a0b74e42377eb594f707d2976bdd714788ca3240c29daf7b2"},"schema_version":"1.0"},"canonical_sha256":"45331b2fe6f4bc59916a978491d660b66abd228a6db06f6991af9b5510a8ac66","source":{"kind":"arxiv","id":"1603.07737","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07737","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07737v1","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07737","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"IUZRWL7G6S6F","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IUZRWL7G6S6FTELK","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IUZRWL7G","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IUZRWL7G6S6FTELKS6CJDVTAWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T20:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"0d131d6d9e806b17e3143f5ea154ca3082d8595a64629bccab1589f96992e5db","abstract_canon_sha256":"8b7607a963fc226a0b74e42377eb594f707d2976bdd714788ca3240c29daf7b2"},"schema_version":"1.0"},"canonical_sha256":"45331b2fe6f4bc59916a978491d660b66abd228a6db06f6991af9b5510a8ac66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:18.992601Z","signature_b64":"nFrbwImR+24I3ROJzsA7q6akT/op19qdzv84HEgXROdowAilrzHSWzyplsfiyPAuhWMRScyH4kW/b5u4y/4UBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45331b2fe6f4bc59916a978491d660b66abd228a6db06f6991af9b5510a8ac66","last_reissued_at":"2026-05-18T01:18:18.991850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:18.991850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07737","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:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBtmKNW9WkQL1FrEnV52iVc2xtd6WGTTg9cgeK/x4S1Cv6Y7ZoYN3wFAHwd/x4Eq3EFra57UGQK6HW3PTy2+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:34:20.174126Z"},"content_sha256":"15dd19e5e048bf31810ed2890d4ff43ba277fdc80af6bf76ea7d6bcf4db801e8","schema_version":"1.0","event_id":"sha256:15dd19e5e048bf31810ed2890d4ff43ba277fdc80af6bf76ea7d6bcf4db801e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IUZRWL7G6S6FTELKS6CJDVTAWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Planar Tree Packing Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters","submitted_at":"2016-03-24T20:08:38Z","abstract_excerpt":"Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and have to find a planar graph on n vertices that is the edge-disjoint union of T1 and T2. A clear exception that must be made is the star which cannot be packed together with any other tree. But according to a conjecture of Garc\\'ia et al. from 1997 this is the only exception, and all other pairs of trees admit a planar packing. Previous results addressed vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07737","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:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vN8OZs38uKEJAv6qNelIXuxERc7QHg2z5Gad/zrB8MuRvb3BhR3RHrj8iCPdKgT2SBvwX0l3juUYq7q7T+ZFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:34:20.174803Z"},"content_sha256":"ce58c32cf15c9e9b432b08bdb9f9fca2cdc980ff150077ef199dd583a55cc9eb","schema_version":"1.0","event_id":"sha256:ce58c32cf15c9e9b432b08bdb9f9fca2cdc980ff150077ef199dd583a55cc9eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/bundle.json","state_url":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/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-27T16:34:20Z","links":{"resolver":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ","bundle":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/bundle.json","state":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IUZRWL7G6S6FTELKS6CJDVTAWZ","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":"8b7607a963fc226a0b74e42377eb594f707d2976bdd714788ca3240c29daf7b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T20:08:38Z","title_canon_sha256":"0d131d6d9e806b17e3143f5ea154ca3082d8595a64629bccab1589f96992e5db"},"schema_version":"1.0","source":{"id":"1603.07737","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07737","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07737v1","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07737","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"IUZRWL7G6S6F","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IUZRWL7G6S6FTELK","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IUZRWL7G","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:ce58c32cf15c9e9b432b08bdb9f9fca2cdc980ff150077ef199dd583a55cc9eb","target":"graph","created_at":"2026-05-18T01:18: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":"Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and have to find a planar graph on n vertices that is the edge-disjoint union of T1 and T2. A clear exception that must be made is the star which cannot be packed together with any other tree. But according to a conjecture of Garc\\'ia et al. from 1997 this is the only exception, and all other pairs of trees admit a planar packing. Previous results addressed vari","authors_text":"Csaba D. T\\'oth, Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T20:08:38Z","title":"The Planar Tree Packing Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07737","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:15dd19e5e048bf31810ed2890d4ff43ba277fdc80af6bf76ea7d6bcf4db801e8","target":"record","created_at":"2026-05-18T01:18: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":"8b7607a963fc226a0b74e42377eb594f707d2976bdd714788ca3240c29daf7b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T20:08:38Z","title_canon_sha256":"0d131d6d9e806b17e3143f5ea154ca3082d8595a64629bccab1589f96992e5db"},"schema_version":"1.0","source":{"id":"1603.07737","kind":"arxiv","version":1}},"canonical_sha256":"45331b2fe6f4bc59916a978491d660b66abd228a6db06f6991af9b5510a8ac66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45331b2fe6f4bc59916a978491d660b66abd228a6db06f6991af9b5510a8ac66","first_computed_at":"2026-05-18T01:18:18.991850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:18.991850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nFrbwImR+24I3ROJzsA7q6akT/op19qdzv84HEgXROdowAilrzHSWzyplsfiyPAuhWMRScyH4kW/b5u4y/4UBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:18.992601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07737","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15dd19e5e048bf31810ed2890d4ff43ba277fdc80af6bf76ea7d6bcf4db801e8","sha256:ce58c32cf15c9e9b432b08bdb9f9fca2cdc980ff150077ef199dd583a55cc9eb"],"state_sha256":"504cb2656f0cefcc4796791637fe1efeed77b0eab576a2b7acc7df5884e4a71c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F7dgeA71acOH41fUa3SNn4ceUHnqruOH9ZK4BZ5Vc3qg3CGzU4OO7oQgbZor86Y5YLNv16rtARA0N1eVbYcFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:34:20.178615Z","bundle_sha256":"d12f68bb14127241bfda01c1f1161972ff448990fdcb06a15f9657f95d9fd5b9"}}