{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:26ELTC5JTJ7NWXXBB7Y3HTSSFC","short_pith_number":"pith:26ELTC5J","canonical_record":{"source":{"id":"1907.04906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-10T20:18:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3066a6f0ef162420e23a8fb703c0ddbaed54ba06be53d1893ada9d1ac3780f49","abstract_canon_sha256":"8641708a6ea126bf1ed1bfb7f5068e42d0076dbf1482a722a409b5c0381a1d8e"},"schema_version":"1.0"},"canonical_sha256":"d788b98ba99a7edb5ee10ff1b3ce52288735238091e3646fe4c457bff05097d9","source":{"kind":"arxiv","id":"1907.04906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04906","created_at":"2026-05-17T23:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04906v1","created_at":"2026-05-17T23:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04906","created_at":"2026-05-17T23:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"26ELTC5JTJ7N","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"26ELTC5JTJ7NWXXB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"26ELTC5J","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:26ELTC5JTJ7NWXXBB7Y3HTSSFC","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-10T20:18:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3066a6f0ef162420e23a8fb703c0ddbaed54ba06be53d1893ada9d1ac3780f49","abstract_canon_sha256":"8641708a6ea126bf1ed1bfb7f5068e42d0076dbf1482a722a409b5c0381a1d8e"},"schema_version":"1.0"},"canonical_sha256":"d788b98ba99a7edb5ee10ff1b3ce52288735238091e3646fe4c457bff05097d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:54.578026Z","signature_b64":"ytADrbOfWt1feFG9qZxiKS8UKMctvYX3444n2Ep7j6sKVqGLpODi+sSovtgLGua7IArQJZq6I4emuPcgbFohCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d788b98ba99a7edb5ee10ff1b3ce52288735238091e3646fe4c457bff05097d9","last_reissued_at":"2026-05-17T23:40:54.577388Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:54.577388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04906","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-17T23:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwS1cDLnjq1vuYjVBOq/2W417gHv86jwzVDHeJfBynm4u9uGqkxsJUF7WD7WVzly55jHsSEwYMIcsbI1y2agAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:49:48.992827Z"},"content_sha256":"023833e589a04ee88d345ee9e3404671402c338622a6186bb3b1cc30d3dd607a","schema_version":"1.0","event_id":"sha256:023833e589a04ee88d345ee9e3404671402c338622a6186bb3b1cc30d3dd607a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:26ELTC5JTJ7NWXXBB7Y3HTSSFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Almost-Disjoint 2-Path Decomposition Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Annika Thome, Matthias Walter","submitted_at":"2019-07-10T20:18:34Z","abstract_excerpt":"We consider the problem of decomposing a given (di)graph into paths of length 2 with the additional restriction that no two such paths may have more than one vertex in common. We establish its NP-hardness by a reduction from 3-SAT, characterize (di)graph classes for which the problem can be be reduced to the Stable-set problem on claw-free graphs and describe a dynamic program for solving it for series-parallel digraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04906","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-17T23:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O29gVcau81+zyM2TsHxB0IjyW4tkEWsK1/a6C+5/+lIa66onXeaHMR4SYcZK9+hKwNHU3e69MaVB2UQrcB+hCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:49:48.993588Z"},"content_sha256":"00536fb6f0eda72983b0272073eb8ab0d2ad996ecf424a4015895f077163c7f5","schema_version":"1.0","event_id":"sha256:00536fb6f0eda72983b0272073eb8ab0d2ad996ecf424a4015895f077163c7f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26ELTC5JTJ7NWXXBB7Y3HTSSFC/bundle.json","state_url":"https://pith.science/pith/26ELTC5JTJ7NWXXBB7Y3HTSSFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26ELTC5JTJ7NWXXBB7Y3HTSSFC/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-05-31T12:49:48Z","links":{"resolver":"https://pith.science/pith/26ELTC5JTJ7NWXXBB7Y3HTSSFC","bundle":"https://pith.science/pith/26ELTC5JTJ7NWXXBB7Y3HTSSFC/bundle.json","state":"https://pith.science/pith/26ELTC5JTJ7NWXXBB7Y3HTSSFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26ELTC5JTJ7NWXXBB7Y3HTSSFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:26ELTC5JTJ7NWXXBB7Y3HTSSFC","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":"8641708a6ea126bf1ed1bfb7f5068e42d0076dbf1482a722a409b5c0381a1d8e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-10T20:18:34Z","title_canon_sha256":"3066a6f0ef162420e23a8fb703c0ddbaed54ba06be53d1893ada9d1ac3780f49"},"schema_version":"1.0","source":{"id":"1907.04906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04906","created_at":"2026-05-17T23:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04906v1","created_at":"2026-05-17T23:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04906","created_at":"2026-05-17T23:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"26ELTC5JTJ7N","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"26ELTC5JTJ7NWXXB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"26ELTC5J","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:00536fb6f0eda72983b0272073eb8ab0d2ad996ecf424a4015895f077163c7f5","target":"graph","created_at":"2026-05-17T23:40:54Z","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":"We consider the problem of decomposing a given (di)graph into paths of length 2 with the additional restriction that no two such paths may have more than one vertex in common. We establish its NP-hardness by a reduction from 3-SAT, characterize (di)graph classes for which the problem can be be reduced to the Stable-set problem on claw-free graphs and describe a dynamic program for solving it for series-parallel digraphs.","authors_text":"Annika Thome, Matthias Walter","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-10T20:18:34Z","title":"The Almost-Disjoint 2-Path Decomposition Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04906","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:023833e589a04ee88d345ee9e3404671402c338622a6186bb3b1cc30d3dd607a","target":"record","created_at":"2026-05-17T23:40:54Z","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":"8641708a6ea126bf1ed1bfb7f5068e42d0076dbf1482a722a409b5c0381a1d8e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-10T20:18:34Z","title_canon_sha256":"3066a6f0ef162420e23a8fb703c0ddbaed54ba06be53d1893ada9d1ac3780f49"},"schema_version":"1.0","source":{"id":"1907.04906","kind":"arxiv","version":1}},"canonical_sha256":"d788b98ba99a7edb5ee10ff1b3ce52288735238091e3646fe4c457bff05097d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d788b98ba99a7edb5ee10ff1b3ce52288735238091e3646fe4c457bff05097d9","first_computed_at":"2026-05-17T23:40:54.577388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:54.577388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ytADrbOfWt1feFG9qZxiKS8UKMctvYX3444n2Ep7j6sKVqGLpODi+sSovtgLGua7IArQJZq6I4emuPcgbFohCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:54.578026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:023833e589a04ee88d345ee9e3404671402c338622a6186bb3b1cc30d3dd607a","sha256:00536fb6f0eda72983b0272073eb8ab0d2ad996ecf424a4015895f077163c7f5"],"state_sha256":"5b10b2abccfc791180dfe57708308822b4784a9d6289bb9ca139ab564bc834d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffrqsQWCayOOvOvPIJRuS4y7cS1zqx7tgrwrOJB6GWtDp444YrmdNXVpjVHcDSESE0KEmID9D5L/+FeVaKHJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:49:48.998159Z","bundle_sha256":"54b2cb292e09cefc5248552bdb0eb65187e6447501eb468fc6bac361b6be9b46"}}