{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IUZRWL7G6S6FTELKS6CJDVTAWZ","short_pith_number":"pith:IUZRWL7G","schema_version":"1.0","canonical_sha256":"45331b2fe6f4bc59916a978491d660b66abd228a6db06f6991af9b5510a8ac66","source":{"kind":"arxiv","id":"1603.07737","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.07737","created_at":"2026-05-18T01:18:18.991977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07737v1","created_at":"2026-05-18T01:18:18.991977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07737","created_at":"2026-05-18T01:18:18.991977+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUZRWL7G6S6F","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUZRWL7G6S6FTELK","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUZRWL7G","created_at":"2026-05-18T12:30:22.444734+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/IUZRWL7G6S6FTELKS6CJDVTAWZ","json":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ.json","graph_json":"https://pith.science/api/pith-number/IUZRWL7G6S6FTELKS6CJDVTAWZ/graph.json","events_json":"https://pith.science/api/pith-number/IUZRWL7G6S6FTELKS6CJDVTAWZ/events.json","paper":"https://pith.science/paper/IUZRWL7G"},"agent_actions":{"view_html":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ","download_json":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ.json","view_paper":"https://pith.science/paper/IUZRWL7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07737&json=true","fetch_graph":"https://pith.science/api/pith-number/IUZRWL7G6S6FTELKS6CJDVTAWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IUZRWL7G6S6FTELKS6CJDVTAWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/action/storage_attestation","attest_author":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/action/author_attestation","sign_citation":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/action/citation_signature","submit_replication":"https://pith.science/pith/IUZRWL7G6S6FTELKS6CJDVTAWZ/action/replication_record"}},"created_at":"2026-05-18T01:18:18.991977+00:00","updated_at":"2026-05-18T01:18:18.991977+00:00"}