{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7WXUGYJLZM5MPSFUOHEOMPIAJE","short_pith_number":"pith:7WXUGYJL","canonical_record":{"source":{"id":"1407.4999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-18T13:47:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3893c86265b444a85efacc013bdcb18307ee32f829816467902acc4cf535f3bb","abstract_canon_sha256":"e5a2e3859c0c7028d94b33313128d788d65579ae5bbdccd10b5da19d69ef1b36"},"schema_version":"1.0"},"canonical_sha256":"fdaf43612bcb3ac7c8b471c8e63d0049284e5451b318cbf1fb360a88ebc6900b","source":{"kind":"arxiv","id":"1407.4999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4999","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4999v1","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4999","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"7WXUGYJLZM5M","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7WXUGYJLZM5MPSFU","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7WXUGYJL","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7WXUGYJLZM5MPSFUOHEOMPIAJE","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-18T13:47:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3893c86265b444a85efacc013bdcb18307ee32f829816467902acc4cf535f3bb","abstract_canon_sha256":"e5a2e3859c0c7028d94b33313128d788d65579ae5bbdccd10b5da19d69ef1b36"},"schema_version":"1.0"},"canonical_sha256":"fdaf43612bcb3ac7c8b471c8e63d0049284e5451b318cbf1fb360a88ebc6900b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:22.173159Z","signature_b64":"/GFkI87l8YMdluRi39Ra9q2CYCoeyNJ3Q4vD4flV8mh3baB7KRa05XXBpAFmNp4TdTYgx74R7uA2IcyEcXhgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdaf43612bcb3ac7c8b471c8e63d0049284e5451b318cbf1fb360a88ebc6900b","last_reissued_at":"2026-05-18T02:47:22.172547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:22.172547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4999","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-18T02:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UefqR3r11SrJVFRZzrdfnAhM08RfRtf33CJ3V4gdPk1IFrPluu0H2ebeOP7X0fQl680QeqabyUutTNS2eT8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:46:48.088587Z"},"content_sha256":"c1373ace34d46c721c8e1e1937094056c43b32a5457bc28a8185ccf6001ac38f","schema_version":"1.0","event_id":"sha256:c1373ace34d46c721c8e1e1937094056c43b32a5457bc28a8185ccf6001ac38f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7WXUGYJLZM5MPSFUOHEOMPIAJE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the tractability of some natural packing, covering and partitioning problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Attila Bern\\'ath, Zolt\\'an Kir\\'aly","submitted_at":"2014-07-18T13:47:45Z","abstract_excerpt":"In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph $G=(V,E)$ and two \"object types\" $\\mathrm{A}$ and $\\mathrm{B}$ chosen from the alternatives above, we consider the following questions. \\textbf{Packing problem:} can we find an object of type $\\mathrm{A}$ and one of type $\\mathrm{B}$ in the edge set $E$ of $G$, so that they are edge-disjoint? \\textbf{Partitioning problem:} can we partition $E$ into an object of type $\\mathrm{A}$ and one of type $\\mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4999","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-18T02:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSQ4rP3tfhy7tp4ZQLB8bQDuK4AEy3Yg88NotGHlix1k3HkHUFptGXa0GIFjYt+ukgxVQcQlzlAaSJnn7ms6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:46:48.088941Z"},"content_sha256":"b63ba74e9ee0e92dd8d24ddb62c2f532eb9d027a73b87388e668f2db6abc1920","schema_version":"1.0","event_id":"sha256:b63ba74e9ee0e92dd8d24ddb62c2f532eb9d027a73b87388e668f2db6abc1920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/bundle.json","state_url":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/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-06-02T01:46:48Z","links":{"resolver":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE","bundle":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/bundle.json","state":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7WXUGYJLZM5MPSFUOHEOMPIAJE","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":"e5a2e3859c0c7028d94b33313128d788d65579ae5bbdccd10b5da19d69ef1b36","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-18T13:47:45Z","title_canon_sha256":"3893c86265b444a85efacc013bdcb18307ee32f829816467902acc4cf535f3bb"},"schema_version":"1.0","source":{"id":"1407.4999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4999","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4999v1","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4999","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"7WXUGYJLZM5M","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7WXUGYJLZM5MPSFU","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7WXUGYJL","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:b63ba74e9ee0e92dd8d24ddb62c2f532eb9d027a73b87388e668f2db6abc1920","target":"graph","created_at":"2026-05-18T02:47:22Z","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":"In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph $G=(V,E)$ and two \"object types\" $\\mathrm{A}$ and $\\mathrm{B}$ chosen from the alternatives above, we consider the following questions. \\textbf{Packing problem:} can we find an object of type $\\mathrm{A}$ and one of type $\\mathrm{B}$ in the edge set $E$ of $G$, so that they are edge-disjoint? \\textbf{Partitioning problem:} can we partition $E$ into an object of type $\\mathrm{A}$ and one of type $\\mat","authors_text":"Attila Bern\\'ath, Zolt\\'an Kir\\'aly","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-18T13:47:45Z","title":"On the tractability of some natural packing, covering and partitioning problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4999","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:c1373ace34d46c721c8e1e1937094056c43b32a5457bc28a8185ccf6001ac38f","target":"record","created_at":"2026-05-18T02:47:22Z","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":"e5a2e3859c0c7028d94b33313128d788d65579ae5bbdccd10b5da19d69ef1b36","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-18T13:47:45Z","title_canon_sha256":"3893c86265b444a85efacc013bdcb18307ee32f829816467902acc4cf535f3bb"},"schema_version":"1.0","source":{"id":"1407.4999","kind":"arxiv","version":1}},"canonical_sha256":"fdaf43612bcb3ac7c8b471c8e63d0049284e5451b318cbf1fb360a88ebc6900b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdaf43612bcb3ac7c8b471c8e63d0049284e5451b318cbf1fb360a88ebc6900b","first_computed_at":"2026-05-18T02:47:22.172547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:22.172547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/GFkI87l8YMdluRi39Ra9q2CYCoeyNJ3Q4vD4flV8mh3baB7KRa05XXBpAFmNp4TdTYgx74R7uA2IcyEcXhgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:22.173159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1373ace34d46c721c8e1e1937094056c43b32a5457bc28a8185ccf6001ac38f","sha256:b63ba74e9ee0e92dd8d24ddb62c2f532eb9d027a73b87388e668f2db6abc1920"],"state_sha256":"6a9312a95d16c6ded238dfd4411715a282656dda0cc4fa3ae01add36125e3542"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3S0qJV1nMzpUZHs354+Dgd64ctnrcU9jK/ZJE/pskPlSF/zaZhCREohrs3U0zSCO3GKReIuUEhPQp7ejtGHlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:46:48.091015Z","bundle_sha256":"e5d45cc485f8952e6c58e0172fd4c291d4718b82f61571314771146794adb36d"}}