{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7NEKGICM2QXNHWUHSQPYSOBKKE","short_pith_number":"pith:7NEKGICM","canonical_record":{"source":{"id":"1709.08949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-26T11:34:38Z","cross_cats_sorted":[],"title_canon_sha256":"cc2f254fa475472d52ed248202582e3a3ab7127f53515f43d9eb6053b6cc3bbe","abstract_canon_sha256":"5f213e2ae5718ba017474fad7045a05381eade495af7a6d2f12731ff9ca1d171"},"schema_version":"1.0"},"canonical_sha256":"fb48a3204cd42ed3da87941f89382a5114f5a9144677a8254e6ed78025ae9c7c","source":{"kind":"arxiv","id":"1709.08949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08949","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08949v1","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08949","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"pith_short_12","alias_value":"7NEKGICM2QXN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7NEKGICM2QXNHWUH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7NEKGICM","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7NEKGICM2QXNHWUHSQPYSOBKKE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-26T11:34:38Z","cross_cats_sorted":[],"title_canon_sha256":"cc2f254fa475472d52ed248202582e3a3ab7127f53515f43d9eb6053b6cc3bbe","abstract_canon_sha256":"5f213e2ae5718ba017474fad7045a05381eade495af7a6d2f12731ff9ca1d171"},"schema_version":"1.0"},"canonical_sha256":"fb48a3204cd42ed3da87941f89382a5114f5a9144677a8254e6ed78025ae9c7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:21.503307Z","signature_b64":"rYk+2qmlhYNcpZQrvi8vU1zmVPjXscN5O7DE5PZrvDZXz0LvaRSUacsHPqcra0uNPsmLSQA1VO6WyJoBd8ThAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb48a3204cd42ed3da87941f89382a5114f5a9144677a8254e6ed78025ae9c7c","last_reissued_at":"2026-05-18T00:34:21.502656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:21.502656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08949","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:34:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6on2PRwWiOYmsRSHaXTj2EikbNuu8R72ebMDpmh8whluVyF6sqKhW2DdCebD1gy64Kb6OHjetYO50Jt1geeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:14:34.191252Z"},"content_sha256":"97e0b1756c081bcff7c955af66d1f0d587d2534a4e49fed01868c3f7dc38a666","schema_version":"1.0","event_id":"sha256:97e0b1756c081bcff7c955af66d1f0d587d2534a4e49fed01868c3f7dc38a666"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7NEKGICM2QXNHWUHSQPYSOBKKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Tree Decompositions with FlowCutter: PACE 2017 Submission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Strasser","submitted_at":"2017-09-26T11:34:38Z","abstract_excerpt":"We describe the algorithm behind our PACE 2017 submission to the heuristic tree decomposition computation track. It was the only competitor to solve all instances and won a tight second place. The algorithm was originally developed in the context of accelerating shortest path computation on road graphs using multilevel partitions. We illustrate how this seemingly unrelated field fits into tree decomposition and parameterized complexity theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08949","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:34:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZC/Tw1J841WiWE8Q7YTg/TxM/j42OOeo+thrHFoxiyh7r7r4D2yEgsJ+KhKS+YghrjiArVgvbj54MVaJ1QWKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:14:34.191619Z"},"content_sha256":"3a7376d8bb6fd9d89014e77cb17d69d77abc89c3aa32e1a2c3e688a966949951","schema_version":"1.0","event_id":"sha256:3a7376d8bb6fd9d89014e77cb17d69d77abc89c3aa32e1a2c3e688a966949951"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NEKGICM2QXNHWUHSQPYSOBKKE/bundle.json","state_url":"https://pith.science/pith/7NEKGICM2QXNHWUHSQPYSOBKKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NEKGICM2QXNHWUHSQPYSOBKKE/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-30T08:14:34Z","links":{"resolver":"https://pith.science/pith/7NEKGICM2QXNHWUHSQPYSOBKKE","bundle":"https://pith.science/pith/7NEKGICM2QXNHWUHSQPYSOBKKE/bundle.json","state":"https://pith.science/pith/7NEKGICM2QXNHWUHSQPYSOBKKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NEKGICM2QXNHWUHSQPYSOBKKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7NEKGICM2QXNHWUHSQPYSOBKKE","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":"5f213e2ae5718ba017474fad7045a05381eade495af7a6d2f12731ff9ca1d171","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-26T11:34:38Z","title_canon_sha256":"cc2f254fa475472d52ed248202582e3a3ab7127f53515f43d9eb6053b6cc3bbe"},"schema_version":"1.0","source":{"id":"1709.08949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08949","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08949v1","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08949","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"pith_short_12","alias_value":"7NEKGICM2QXN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7NEKGICM2QXNHWUH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7NEKGICM","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:3a7376d8bb6fd9d89014e77cb17d69d77abc89c3aa32e1a2c3e688a966949951","target":"graph","created_at":"2026-05-18T00:34: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":"We describe the algorithm behind our PACE 2017 submission to the heuristic tree decomposition computation track. It was the only competitor to solve all instances and won a tight second place. The algorithm was originally developed in the context of accelerating shortest path computation on road graphs using multilevel partitions. We illustrate how this seemingly unrelated field fits into tree decomposition and parameterized complexity theory.","authors_text":"Ben Strasser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-26T11:34:38Z","title":"Computing Tree Decompositions with FlowCutter: PACE 2017 Submission"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08949","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:97e0b1756c081bcff7c955af66d1f0d587d2534a4e49fed01868c3f7dc38a666","target":"record","created_at":"2026-05-18T00:34: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":"5f213e2ae5718ba017474fad7045a05381eade495af7a6d2f12731ff9ca1d171","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-26T11:34:38Z","title_canon_sha256":"cc2f254fa475472d52ed248202582e3a3ab7127f53515f43d9eb6053b6cc3bbe"},"schema_version":"1.0","source":{"id":"1709.08949","kind":"arxiv","version":1}},"canonical_sha256":"fb48a3204cd42ed3da87941f89382a5114f5a9144677a8254e6ed78025ae9c7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb48a3204cd42ed3da87941f89382a5114f5a9144677a8254e6ed78025ae9c7c","first_computed_at":"2026-05-18T00:34:21.502656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:21.502656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rYk+2qmlhYNcpZQrvi8vU1zmVPjXscN5O7DE5PZrvDZXz0LvaRSUacsHPqcra0uNPsmLSQA1VO6WyJoBd8ThAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:21.503307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97e0b1756c081bcff7c955af66d1f0d587d2534a4e49fed01868c3f7dc38a666","sha256:3a7376d8bb6fd9d89014e77cb17d69d77abc89c3aa32e1a2c3e688a966949951"],"state_sha256":"7b006b7b64de3b10597375acdc2af7dbe3645a557298027cb3c65a622ed5a923"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a97VHmywYMeonzXVyi1WqVP4lr15r0sNs8q1BU8aA93RGkmSBspBy/uGmIEg3IQJHwXPeGvvSc8Orpu40yzzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:14:34.193629Z","bundle_sha256":"139c02aab7f88cd2c51109f4948abecd729a668d5271d31da35f657e8277a14b"}}