{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:F5B5LGN2POWDRKJ65SXY3WI2R7","short_pith_number":"pith:F5B5LGN2","canonical_record":{"source":{"id":"1905.01134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T12:03:32Z","cross_cats_sorted":[],"title_canon_sha256":"36a8030725c7fa04d5956c138a22c648c03983a826fda961686956434fb3c710","abstract_canon_sha256":"f81fa36270c94242d3dc45396d081bc47d20f7d59b6c31cbb3e4d5c9d352533e"},"schema_version":"1.0"},"canonical_sha256":"2f43d599ba7bac38a93eecaf8dd91a8ff45c69879cd01dc6e0657ff6ce73c186","source":{"kind":"arxiv","id":"1905.01134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01134","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01134v1","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01134","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"F5B5LGN2POWD","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F5B5LGN2POWDRKJ6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F5B5LGN2","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:F5B5LGN2POWDRKJ65SXY3WI2R7","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T12:03:32Z","cross_cats_sorted":[],"title_canon_sha256":"36a8030725c7fa04d5956c138a22c648c03983a826fda961686956434fb3c710","abstract_canon_sha256":"f81fa36270c94242d3dc45396d081bc47d20f7d59b6c31cbb3e4d5c9d352533e"},"schema_version":"1.0"},"canonical_sha256":"2f43d599ba7bac38a93eecaf8dd91a8ff45c69879cd01dc6e0657ff6ce73c186","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.740153Z","signature_b64":"LRI1esI+htm7ccdN2Shk2nRlO/GwsE2tDfykSkFZ0Opyg4byU2rp+mBUgONcIN87ZQL/eKbxaQwYcyzNCEs3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f43d599ba7bac38a93eecaf8dd91a8ff45c69879cd01dc6e0657ff6ce73c186","last_reissued_at":"2026-05-17T23:47:06.739287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.739287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01134","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:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZ7I7+WpwApQf0CQYrNjgh66EXsDkIG/puM11Uacg04SEDS64cV79JtM134HfYG+SfN1DKyvtrPEwrvJIz5XAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:02:43.872738Z"},"content_sha256":"eb33254315bfd8bd5b771cc325fa0b799113ab97d517f4a56e8b588c6015cd1f","schema_version":"1.0","event_id":"sha256:eb33254315bfd8bd5b771cc325fa0b799113ab97d517f4a56e8b588c6015cd1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:F5B5LGN2POWDRKJ65SXY3WI2R7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Positive-Instance Driven Dynamic Programming for Graph Searching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Max Bannach, Sebastian Berndt","submitted_at":"2019-05-03T12:03:32Z","abstract_excerpt":"Research on the similarity of a graph to being a tree - called the treewidth of the graph - has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based on dynamic programming and makes use of the fact that the number of positive subinstances is typically substantially smaller than the number of all subinstances. Algorithms producing only such subinstances are called positive-instance driven (PID). We give an alternative and intuitive view on this algorithm from the perspective of the corres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01134","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:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VbbsDcwdR9Ur4+MPZRWGR01SUfTjRfkvlp+8GhA/X2z1B856vfty1k3wSNmtqK1X4wVqiV3LSnrBpf9y/tEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:02:43.873275Z"},"content_sha256":"b21187224046f4e17a7752dcd1a5713801197c1af1a24307b975678c0ce87ed8","schema_version":"1.0","event_id":"sha256:b21187224046f4e17a7752dcd1a5713801197c1af1a24307b975678c0ce87ed8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5B5LGN2POWDRKJ65SXY3WI2R7/bundle.json","state_url":"https://pith.science/pith/F5B5LGN2POWDRKJ65SXY3WI2R7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5B5LGN2POWDRKJ65SXY3WI2R7/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-06-07T20:02:43Z","links":{"resolver":"https://pith.science/pith/F5B5LGN2POWDRKJ65SXY3WI2R7","bundle":"https://pith.science/pith/F5B5LGN2POWDRKJ65SXY3WI2R7/bundle.json","state":"https://pith.science/pith/F5B5LGN2POWDRKJ65SXY3WI2R7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5B5LGN2POWDRKJ65SXY3WI2R7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:F5B5LGN2POWDRKJ65SXY3WI2R7","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":"f81fa36270c94242d3dc45396d081bc47d20f7d59b6c31cbb3e4d5c9d352533e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T12:03:32Z","title_canon_sha256":"36a8030725c7fa04d5956c138a22c648c03983a826fda961686956434fb3c710"},"schema_version":"1.0","source":{"id":"1905.01134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01134","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01134v1","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01134","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"F5B5LGN2POWD","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F5B5LGN2POWDRKJ6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F5B5LGN2","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:b21187224046f4e17a7752dcd1a5713801197c1af1a24307b975678c0ce87ed8","target":"graph","created_at":"2026-05-17T23:47:06Z","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":"Research on the similarity of a graph to being a tree - called the treewidth of the graph - has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based on dynamic programming and makes use of the fact that the number of positive subinstances is typically substantially smaller than the number of all subinstances. Algorithms producing only such subinstances are called positive-instance driven (PID). We give an alternative and intuitive view on this algorithm from the perspective of the corres","authors_text":"Max Bannach, Sebastian Berndt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T12:03:32Z","title":"Positive-Instance Driven Dynamic Programming for Graph Searching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01134","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:eb33254315bfd8bd5b771cc325fa0b799113ab97d517f4a56e8b588c6015cd1f","target":"record","created_at":"2026-05-17T23:47:06Z","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":"f81fa36270c94242d3dc45396d081bc47d20f7d59b6c31cbb3e4d5c9d352533e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T12:03:32Z","title_canon_sha256":"36a8030725c7fa04d5956c138a22c648c03983a826fda961686956434fb3c710"},"schema_version":"1.0","source":{"id":"1905.01134","kind":"arxiv","version":1}},"canonical_sha256":"2f43d599ba7bac38a93eecaf8dd91a8ff45c69879cd01dc6e0657ff6ce73c186","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f43d599ba7bac38a93eecaf8dd91a8ff45c69879cd01dc6e0657ff6ce73c186","first_computed_at":"2026-05-17T23:47:06.739287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:06.739287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LRI1esI+htm7ccdN2Shk2nRlO/GwsE2tDfykSkFZ0Opyg4byU2rp+mBUgONcIN87ZQL/eKbxaQwYcyzNCEs3Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:06.740153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb33254315bfd8bd5b771cc325fa0b799113ab97d517f4a56e8b588c6015cd1f","sha256:b21187224046f4e17a7752dcd1a5713801197c1af1a24307b975678c0ce87ed8"],"state_sha256":"37fe77f6c525856563941e816c85729cb929f323516359e4538d3fa9c12ffe85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJpaEFSHcgJt4E/UwXX51ak8vhjxfSjpp2hiMfCJZj8tJvoyBzKENjY4ayQSguVlqshTHPA3m0shqLdG26t9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:02:43.876875Z","bundle_sha256":"084c830ace0cbba7bb681f949ac6d56693d88e54e5e668c2672420e97596358b"}}