{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JLQEWHONQSUHB3BVQPP3EKS7OL","short_pith_number":"pith:JLQEWHON","canonical_record":{"source":{"id":"1708.02772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T09:45:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4e1a093fa0eb0c59e61c1e0736e63c11079662b4e8ba5b29d60e65b6821c1106","abstract_canon_sha256":"dcce448cb5e44cbd698f6fd6b247905e7f50b6b904a0166b968f0fefcef1e76f"},"schema_version":"1.0"},"canonical_sha256":"4ae04b1dcd84a870ec3583dfb22a5f72d99dc9ed351f7af02c6113644ffd8a07","source":{"kind":"arxiv","id":"1708.02772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02772","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02772v1","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02772","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"JLQEWHONQSUH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLQEWHONQSUHB3BV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLQEWHON","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JLQEWHONQSUHB3BVQPP3EKS7OL","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T09:45:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4e1a093fa0eb0c59e61c1e0736e63c11079662b4e8ba5b29d60e65b6821c1106","abstract_canon_sha256":"dcce448cb5e44cbd698f6fd6b247905e7f50b6b904a0166b968f0fefcef1e76f"},"schema_version":"1.0"},"canonical_sha256":"4ae04b1dcd84a870ec3583dfb22a5f72d99dc9ed351f7af02c6113644ffd8a07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:19.579517Z","signature_b64":"hsEX6N1/QXT5CiiqNTP0cg03wEls2aew7J3u9xswhzWNFDCfvR2lmOYeCfemKD4IAVYDyCpruAEMbCxXxDa0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ae04b1dcd84a870ec3583dfb22a5f72d99dc9ed351f7af02c6113644ffd8a07","last_reissued_at":"2026-05-18T00:38:19.578858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:19.578858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02772","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-18T00:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tnEdmGydLhxDwoC4LFNuYRUe0swggynvZ/JIeE7yJuBQ3ySkNZ9ONvlw5Wug7gB1t+jrlp2eQBXeH21vrQlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:13:41.357994Z"},"content_sha256":"e82497faf9c4ff163ea15fb419ba5d40e61acc6a8e6342eec16cfff74c6d0511","schema_version":"1.0","event_id":"sha256:e82497faf9c4ff163ea15fb419ba5d40e61acc6a8e6342eec16cfff74c6d0511"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JLQEWHONQSUHB3BVQPP3EKS7OL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Maximum Common Subgraph Problems in Series-Parallel Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Florian Kurpicz, Nils Kriege, Petra Mutzel","submitted_at":"2017-08-09T09:45:22Z","abstract_excerpt":"The complexity of the maximum common connected subgraph problem in partial $k$-trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplanar graphs, a subclass of the partial $2$-trees. On the other hand, the problem is known to be ${\\bf NP}$-hard in vertex-labeled partial $11$-trees of bounded degree. We consider series-parallel graphs, i.e., partial $2$-trees. We show that the problem remains ${\\bf NP}$-hard in biconnected series-parallel graphs with all but one vertex of degree $3$ or less. A positive complexity result is presented for a related pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02772","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-18T00:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rI6ujRJYVYspmcrGXDdS3DB5Q3pAMyJjDMpd2wHP3vm+fbW3r3V/xCmE43QAAvlR/vldALnyKUcUIArcABsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:13:41.358616Z"},"content_sha256":"1caead798375485bd5a5daa5859352e81570082aedee7ac482eca7804394e59f","schema_version":"1.0","event_id":"sha256:1caead798375485bd5a5daa5859352e81570082aedee7ac482eca7804394e59f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLQEWHONQSUHB3BVQPP3EKS7OL/bundle.json","state_url":"https://pith.science/pith/JLQEWHONQSUHB3BVQPP3EKS7OL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLQEWHONQSUHB3BVQPP3EKS7OL/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-30T13:13:41Z","links":{"resolver":"https://pith.science/pith/JLQEWHONQSUHB3BVQPP3EKS7OL","bundle":"https://pith.science/pith/JLQEWHONQSUHB3BVQPP3EKS7OL/bundle.json","state":"https://pith.science/pith/JLQEWHONQSUHB3BVQPP3EKS7OL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLQEWHONQSUHB3BVQPP3EKS7OL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JLQEWHONQSUHB3BVQPP3EKS7OL","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":"dcce448cb5e44cbd698f6fd6b247905e7f50b6b904a0166b968f0fefcef1e76f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T09:45:22Z","title_canon_sha256":"4e1a093fa0eb0c59e61c1e0736e63c11079662b4e8ba5b29d60e65b6821c1106"},"schema_version":"1.0","source":{"id":"1708.02772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02772","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02772v1","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02772","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"JLQEWHONQSUH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLQEWHONQSUHB3BV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLQEWHON","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:1caead798375485bd5a5daa5859352e81570082aedee7ac482eca7804394e59f","target":"graph","created_at":"2026-05-18T00:38:19Z","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 complexity of the maximum common connected subgraph problem in partial $k$-trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplanar graphs, a subclass of the partial $2$-trees. On the other hand, the problem is known to be ${\\bf NP}$-hard in vertex-labeled partial $11$-trees of bounded degree. We consider series-parallel graphs, i.e., partial $2$-trees. We show that the problem remains ${\\bf NP}$-hard in biconnected series-parallel graphs with all but one vertex of degree $3$ or less. A positive complexity result is presented for a related pro","authors_text":"Florian Kurpicz, Nils Kriege, Petra Mutzel","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T09:45:22Z","title":"On Maximum Common Subgraph Problems in Series-Parallel Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02772","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:e82497faf9c4ff163ea15fb419ba5d40e61acc6a8e6342eec16cfff74c6d0511","target":"record","created_at":"2026-05-18T00:38:19Z","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":"dcce448cb5e44cbd698f6fd6b247905e7f50b6b904a0166b968f0fefcef1e76f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T09:45:22Z","title_canon_sha256":"4e1a093fa0eb0c59e61c1e0736e63c11079662b4e8ba5b29d60e65b6821c1106"},"schema_version":"1.0","source":{"id":"1708.02772","kind":"arxiv","version":1}},"canonical_sha256":"4ae04b1dcd84a870ec3583dfb22a5f72d99dc9ed351f7af02c6113644ffd8a07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ae04b1dcd84a870ec3583dfb22a5f72d99dc9ed351f7af02c6113644ffd8a07","first_computed_at":"2026-05-18T00:38:19.578858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:19.578858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hsEX6N1/QXT5CiiqNTP0cg03wEls2aew7J3u9xswhzWNFDCfvR2lmOYeCfemKD4IAVYDyCpruAEMbCxXxDa0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:19.579517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e82497faf9c4ff163ea15fb419ba5d40e61acc6a8e6342eec16cfff74c6d0511","sha256:1caead798375485bd5a5daa5859352e81570082aedee7ac482eca7804394e59f"],"state_sha256":"b6a1bfb1af692559a32adc73ccf02925bf08c828880a545997f4b379106e752a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6XilcMYN8ftU8xx9ywhCFq+VSpVgZxwZ5/642ZS/Hi68PpisB1vCFoTZ3GdieV0DexufWHKYozLnX9VgJ1qBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:13:41.361049Z","bundle_sha256":"575637ae7a4347716026f7e2e5992f2ad7613bb0fc43390883fbb760cbf12488"}}