{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:SWJSV3DKYLUEKORRJEGNF5CKPM","short_pith_number":"pith:SWJSV3DK","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"},"canonical_sha256":"95932aec6ac2e8453a31490cd2f44a7b26c692513284aa8253c85354962c9b04","source":{"kind":"arxiv","id":"0910.2766","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.2766","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"0910.2766v2","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2766","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"SWJSV3DKYLUE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SWJSV3DKYLUEKORR","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SWJSV3DK","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:SWJSV3DKYLUEKORRJEGNF5CKPM","target":"record","payload":{"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"},"canonical_sha256":"95932aec6ac2e8453a31490cd2f44a7b26c692513284aa8253c85354962c9b04","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"},"source_kind":"arxiv","source_id":"0910.2766","source_version":2,"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-18T04:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WNEYc2CVdjCzaghaUfhHwrnfsE0U9DdhP69s2DhcGeuM2uIP5wJGRK1dH5QZudJ7M8sVvsFEN9V7RIRF8cyjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:40:47.872094Z"},"content_sha256":"8b6b4bc2ccee304a4be90c59ecab1f175850b045a493eb638aa8c2883dab9321","schema_version":"1.0","event_id":"sha256:8b6b4bc2ccee304a4be90c59ecab1f175850b045a493eb638aa8c2883dab9321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:SWJSV3DKYLUEKORRJEGNF5CKPM","target":"graph","payload":{"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"},"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-18T04:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMA8LxrugK/hhDUTJtbpiEBs4PjRB3EL79vSqGfm/EgCHOd5qSS7yQXcYOCDoJ4YfHfB773gnU6h3Gk471X6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:40:47.872459Z"},"content_sha256":"19d31ac7a2d7157e621ab3bb099619795329d98611e5424fdb60584fd7001b56","schema_version":"1.0","event_id":"sha256:19d31ac7a2d7157e621ab3bb099619795329d98611e5424fdb60584fd7001b56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/bundle.json","state_url":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/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-07-02T14:40:47Z","links":{"resolver":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM","bundle":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/bundle.json","state":"https://pith.science/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWJSV3DKYLUEKORRJEGNF5CKPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:SWJSV3DKYLUEKORRJEGNF5CKPM","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":"706523f4b7aa38754b54510af66136068782ecbdccab1dd4808305c7042ffe8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-15T03:00:08Z","title_canon_sha256":"084f2d78300460cd39271227c7483c5ba287d6ad18cf183bb01422f3ea34ad37"},"schema_version":"1.0","source":{"id":"0910.2766","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.2766","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"0910.2766v2","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2766","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"SWJSV3DKYLUE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SWJSV3DKYLUEKORR","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SWJSV3DK","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:19d31ac7a2d7157e621ab3bb099619795329d98611e5424fdb60584fd7001b56","target":"graph","created_at":"2026-05-18T04:17:03Z","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":"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: ","authors_text":"Alexander Kelmans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-15T03:00:08Z","title":"Packing 3-vertex Paths In Cubic 3-connected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2766","kind":"arxiv","version":2},"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:8b6b4bc2ccee304a4be90c59ecab1f175850b045a493eb638aa8c2883dab9321","target":"record","created_at":"2026-05-18T04:17:03Z","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":"706523f4b7aa38754b54510af66136068782ecbdccab1dd4808305c7042ffe8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-15T03:00:08Z","title_canon_sha256":"084f2d78300460cd39271227c7483c5ba287d6ad18cf183bb01422f3ea34ad37"},"schema_version":"1.0","source":{"id":"0910.2766","kind":"arxiv","version":2}},"canonical_sha256":"95932aec6ac2e8453a31490cd2f44a7b26c692513284aa8253c85354962c9b04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95932aec6ac2e8453a31490cd2f44a7b26c692513284aa8253c85354962c9b04","first_computed_at":"2026-05-18T04:17:03.471686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:03.471686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D5AHVU8K9yPk6nsFiNFzuRHaezxGB13HBu7svAGcOFd9iRayqFOXnQK1fuYUGNdMnzrzSayea9JNQLUDBmUPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:03.472178Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.2766","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b6b4bc2ccee304a4be90c59ecab1f175850b045a493eb638aa8c2883dab9321","sha256:19d31ac7a2d7157e621ab3bb099619795329d98611e5424fdb60584fd7001b56"],"state_sha256":"4f5c1626e35fb794eb42bc7ca772e95165faec5d5cba3a8a7b075df9cb99fb36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFCh45WLXDV8t5kqLWqf03Ooh+9d39iFczq7DAzVMdCFAmmB2y//xC9HpHQ9M8gA3V5yD1svK3zios/MbkQDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T14:40:47.874451Z","bundle_sha256":"14896a2e39a253bc1a2e296a15112c2972a63936311c76967a8369234810c1f1"}}