{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7WXUGYJLZM5MPSFUOHEOMPIAJE","short_pith_number":"pith:7WXUGYJL","schema_version":"1.0","canonical_sha256":"fdaf43612bcb3ac7c8b471c8e63d0049284e5451b318cbf1fb360a88ebc6900b","source":{"kind":"arxiv","id":"1407.4999","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.4999","created_at":"2026-05-18T02:47:22.172640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4999v1","created_at":"2026-05-18T02:47:22.172640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4999","created_at":"2026-05-18T02:47:22.172640+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WXUGYJLZM5M","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WXUGYJLZM5MPSFU","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WXUGYJL","created_at":"2026-05-18T12:28:19.803747+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/7WXUGYJLZM5MPSFUOHEOMPIAJE","json":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE.json","graph_json":"https://pith.science/api/pith-number/7WXUGYJLZM5MPSFUOHEOMPIAJE/graph.json","events_json":"https://pith.science/api/pith-number/7WXUGYJLZM5MPSFUOHEOMPIAJE/events.json","paper":"https://pith.science/paper/7WXUGYJL"},"agent_actions":{"view_html":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE","download_json":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE.json","view_paper":"https://pith.science/paper/7WXUGYJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4999&json=true","fetch_graph":"https://pith.science/api/pith-number/7WXUGYJLZM5MPSFUOHEOMPIAJE/graph.json","fetch_events":"https://pith.science/api/pith-number/7WXUGYJLZM5MPSFUOHEOMPIAJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/action/storage_attestation","attest_author":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/action/author_attestation","sign_citation":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/action/citation_signature","submit_replication":"https://pith.science/pith/7WXUGYJLZM5MPSFUOHEOMPIAJE/action/replication_record"}},"created_at":"2026-05-18T02:47:22.172640+00:00","updated_at":"2026-05-18T02:47:22.172640+00:00"}