{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:SWJSV3DKYLUEKORRJEGNF5CKPM","short_pith_number":"pith:SWJSV3DK","schema_version":"1.0","canonical_sha256":"95932aec6ac2e8453a31490cd2f44a7b26c692513284aa8253c85354962c9b04","source":{"kind":"arxiv","id":"0910.2766","version":2},"attestation_state":"computed","paper":{"title":"Packing 3-vertex Paths In Cubic 3-connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Kelmans","submitted_at":"2009-10-15T03:00:08Z","abstract_excerpt":"A subgraph (a spanning subgraph) of a graph G whose all components are 3-vertex paths is called an L-packing (respectively, an L-factor} of G. We discuss the following old\n  PROBLEM (A. Kelmans, 1984). Is the following claim true?\n  (C) If G is a cubic 3-connected graph, then G has an L-packing that avoids at most two vertices of G.\n  We show, in particular, that claim (C) is equivalent to some seemingly stronger claims (see Theorem 3.1 below).\n  For example, if G is a cubic 3-connected graph and the number of vertices of G is divisible by three, then then the following claims are equivalent: "},"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":"0910.2766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-15T03:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"084f2d78300460cd39271227c7483c5ba287d6ad18cf183bb01422f3ea34ad37","abstract_canon_sha256":"706523f4b7aa38754b54510af66136068782ecbdccab1dd4808305c7042ffe8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:03.472178Z","signature_b64":"D5AHVU8K9yPk6nsFiNFzuRHaezxGB13HBu7svAGcOFd9iRayqFOXnQK1fuYUGNdMnzrzSayea9JNQLUDBmUPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95932aec6ac2e8453a31490cd2f44a7b26c692513284aa8253c85354962c9b04","last_reissued_at":"2026-05-18T04:17:03.471686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:03.471686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing 3-vertex Paths In Cubic 3-connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Kelmans","submitted_at":"2009-10-15T03:00:08Z","abstract_excerpt":"A subgraph (a spanning subgraph) of a graph G whose all components are 3-vertex paths is called an L-packing (respectively, an L-factor} of G. We discuss the following old\n  PROBLEM (A. Kelmans, 1984). Is the following claim true?\n  (C) If G is a cubic 3-connected graph, then G has an L-packing that avoids at most two vertices of G.\n  We show, in particular, that claim (C) is equivalent to some seemingly stronger claims (see Theorem 3.1 below).\n  For example, if G is a cubic 3-connected graph and the number of vertices of G is divisible by three, then then the following claims are equivalent: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2766","kind":"arxiv","version":2},"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":"0910.2766","created_at":"2026-05-18T04:17:03.471751+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.2766v2","created_at":"2026-05-18T04:17:03.471751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2766","created_at":"2026-05-18T04:17:03.471751+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWJSV3DKYLUE","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWJSV3DKYLUEKORR","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWJSV3DK","created_at":"2026-05-18T12:26:01.383474+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/SWJSV3DKYLUEKORRJEGNF5CKPM","json":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM.json","graph_json":"https://pith.science/api/pith-number/SWJSV3DKYLUEKORRJEGNF5CKPM/graph.json","events_json":"https://pith.science/api/pith-number/SWJSV3DKYLUEKORRJEGNF5CKPM/events.json","paper":"https://pith.science/paper/SWJSV3DK"},"agent_actions":{"view_html":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM","download_json":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM.json","view_paper":"https://pith.science/paper/SWJSV3DK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.2766&json=true","fetch_graph":"https://pith.science/api/pith-number/SWJSV3DKYLUEKORRJEGNF5CKPM/graph.json","fetch_events":"https://pith.science/api/pith-number/SWJSV3DKYLUEKORRJEGNF5CKPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/action/storage_attestation","attest_author":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/action/author_attestation","sign_citation":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/action/citation_signature","submit_replication":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/action/replication_record"}},"created_at":"2026-05-18T04:17:03.471751+00:00","updated_at":"2026-05-18T04:17:03.471751+00:00"}