{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SOVKJYYTDOSJLVTTPSMMOHU3CU","short_pith_number":"pith:SOVKJYYT","canonical_record":{"source":{"id":"1609.04951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-16T08:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"01839292afb0a1cc38f0b2f3fc6b89c6c04db915ff71c717126f21c221ef9167","abstract_canon_sha256":"87554360ac30df2d22ea869fbd9df4d063f5d97e458c735d134018e652601593"},"schema_version":"1.0"},"canonical_sha256":"93aaa4e3131ba495d6737c98c71e9b151929a7332bc7b15fca9c6c3e602dbf3f","source":{"kind":"arxiv","id":"1609.04951","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04951","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04951v2","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04951","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"SOVKJYYTDOSJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SOVKJYYTDOSJLVTT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SOVKJYYT","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SOVKJYYTDOSJLVTTPSMMOHU3CU","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-16T08:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"01839292afb0a1cc38f0b2f3fc6b89c6c04db915ff71c717126f21c221ef9167","abstract_canon_sha256":"87554360ac30df2d22ea869fbd9df4d063f5d97e458c735d134018e652601593"},"schema_version":"1.0"},"canonical_sha256":"93aaa4e3131ba495d6737c98c71e9b151929a7332bc7b15fca9c6c3e602dbf3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:21.215231Z","signature_b64":"yg2KGvtiabJcimkr6650/Q5VGOdOZqlTY9v1qKrfdEQyqcROKsEipRXoYdtAxTWy77HZMfxVRWZuXmuJy2VuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93aaa4e3131ba495d6737c98c71e9b151929a7332bc7b15fca9c6c3e602dbf3f","last_reissued_at":"2026-05-18T00:29:21.214678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:21.214678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04951","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-18T00:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTIxD8YDkFP8iyU7/P6NRVysy5G1gQJBnfih1lJEiCbhbt0F4RJnED7RwTzMxpH5wtLA4utnt1zA4XDQnOIZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:41:04.771360Z"},"content_sha256":"6ff16a867d387bbe42fcb18903657eb5624a1150215151ee91e14f2c701b9a78","schema_version":"1.0","event_id":"sha256:6ff16a867d387bbe42fcb18903657eb5624a1150215151ee91e14f2c701b9a78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SOVKJYYTDOSJLVTTPSMMOHU3CU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Disjoint Paths on Edge-Colored Graphs: More Tractability Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Sikora, Riccardo Dondi","submitted_at":"2016-09-16T08:44:58Z","abstract_excerpt":"The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (called MaxCDP) has been recently introduced in literature, motivated by applications in social network analysis. In this paper we investigate how the complexity of the problem depends on graph parameters (namely the number of vertices to remove to make the graph a collection of disjoint paths and the size of the vertex cover of the graph), which makes sense since graphs in social networks are not random and have structure. The problem was known to be hard to approximate in polynomial time and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04951","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-18T00:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1OUdtL0ryBMzwYVx+U3BEsD5KYR7FcYRAHwD9AOFGPbSi76C8pDFfsVotp59bFk+gfF9usW4eG63/SEnwPV5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:41:04.772066Z"},"content_sha256":"4f1072d29f789c9a75dcfc6639bbb30169c5977ed7c36131805d003e917e4951","schema_version":"1.0","event_id":"sha256:4f1072d29f789c9a75dcfc6639bbb30169c5977ed7c36131805d003e917e4951"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOVKJYYTDOSJLVTTPSMMOHU3CU/bundle.json","state_url":"https://pith.science/pith/SOVKJYYTDOSJLVTTPSMMOHU3CU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOVKJYYTDOSJLVTTPSMMOHU3CU/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-31T09:41:04Z","links":{"resolver":"https://pith.science/pith/SOVKJYYTDOSJLVTTPSMMOHU3CU","bundle":"https://pith.science/pith/SOVKJYYTDOSJLVTTPSMMOHU3CU/bundle.json","state":"https://pith.science/pith/SOVKJYYTDOSJLVTTPSMMOHU3CU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOVKJYYTDOSJLVTTPSMMOHU3CU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SOVKJYYTDOSJLVTTPSMMOHU3CU","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":"87554360ac30df2d22ea869fbd9df4d063f5d97e458c735d134018e652601593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-16T08:44:58Z","title_canon_sha256":"01839292afb0a1cc38f0b2f3fc6b89c6c04db915ff71c717126f21c221ef9167"},"schema_version":"1.0","source":{"id":"1609.04951","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04951","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04951v2","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04951","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"SOVKJYYTDOSJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SOVKJYYTDOSJLVTT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SOVKJYYT","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:4f1072d29f789c9a75dcfc6639bbb30169c5977ed7c36131805d003e917e4951","target":"graph","created_at":"2026-05-18T00:29:21Z","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":"The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (called MaxCDP) has been recently introduced in literature, motivated by applications in social network analysis. In this paper we investigate how the complexity of the problem depends on graph parameters (namely the number of vertices to remove to make the graph a collection of disjoint paths and the size of the vertex cover of the graph), which makes sense since graphs in social networks are not random and have structure. The problem was known to be hard to approximate in polynomial time and","authors_text":"Florian Sikora, Riccardo Dondi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-16T08:44:58Z","title":"Finding Disjoint Paths on Edge-Colored Graphs: More Tractability Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04951","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:6ff16a867d387bbe42fcb18903657eb5624a1150215151ee91e14f2c701b9a78","target":"record","created_at":"2026-05-18T00:29:21Z","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":"87554360ac30df2d22ea869fbd9df4d063f5d97e458c735d134018e652601593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-16T08:44:58Z","title_canon_sha256":"01839292afb0a1cc38f0b2f3fc6b89c6c04db915ff71c717126f21c221ef9167"},"schema_version":"1.0","source":{"id":"1609.04951","kind":"arxiv","version":2}},"canonical_sha256":"93aaa4e3131ba495d6737c98c71e9b151929a7332bc7b15fca9c6c3e602dbf3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93aaa4e3131ba495d6737c98c71e9b151929a7332bc7b15fca9c6c3e602dbf3f","first_computed_at":"2026-05-18T00:29:21.214678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:21.214678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yg2KGvtiabJcimkr6650/Q5VGOdOZqlTY9v1qKrfdEQyqcROKsEipRXoYdtAxTWy77HZMfxVRWZuXmuJy2VuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:21.215231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04951","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ff16a867d387bbe42fcb18903657eb5624a1150215151ee91e14f2c701b9a78","sha256:4f1072d29f789c9a75dcfc6639bbb30169c5977ed7c36131805d003e917e4951"],"state_sha256":"f71348a913032708a947e1f68cdba57e3992346cf448c8f95e75920e421d3ac9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOtj4MbMBkJofx6Stx2H5DgTv7uA9AYtMTWJPUkrf8SO91B6uasNRUpBuVGGfXRUVKOT7vsXmoVzDJuWdfpkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:41:04.776115Z","bundle_sha256":"c07891e2bd2ea76b72d757bcdbfe36e2fcddcd15f991ff1bf6b671cf981262b4"}}