{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PR2JNKPS2XCLGUJRF7RPHP3DV6","short_pith_number":"pith:PR2JNKPS","canonical_record":{"source":{"id":"2504.18302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-25T12:20:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5fbe32297773e40e7d48247b87e8477ef21d06e61951a3b0bee8f65642fbd6e5","abstract_canon_sha256":"cb25cad3f8faaa6d6a6aae3e0fb1090e7ca531a29eb139c98bce6e848b9ab6c6"},"schema_version":"1.0"},"canonical_sha256":"7c7496a9f2d5c4b351312fe2f3bf63afbf1818d269fe52b9b222bdb35d30acd5","source":{"kind":"arxiv","id":"2504.18302","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.18302","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"2504.18302v3","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18302","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"PR2JNKPS2XCL","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"pith_short_16","alias_value":"PR2JNKPS2XCLGUJR","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"pith_short_8","alias_value":"PR2JNKPS","created_at":"2026-05-20T00:05:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PR2JNKPS2XCLGUJRF7RPHP3DV6","target":"record","payload":{"canonical_record":{"source":{"id":"2504.18302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-25T12:20:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5fbe32297773e40e7d48247b87e8477ef21d06e61951a3b0bee8f65642fbd6e5","abstract_canon_sha256":"cb25cad3f8faaa6d6a6aae3e0fb1090e7ca531a29eb139c98bce6e848b9ab6c6"},"schema_version":"1.0"},"canonical_sha256":"7c7496a9f2d5c4b351312fe2f3bf63afbf1818d269fe52b9b222bdb35d30acd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:28.430925Z","signature_b64":"plhzrer+xnN67roiQ3hV8lpGaaSzyXJ1BZP06iHQ0X8tY2uyabP5sT02oUIaEYkdl+PC8XnwXsFGzJkuFLO6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c7496a9f2d5c4b351312fe2f3bf63afbf1818d269fe52b9b222bdb35d30acd5","last_reissued_at":"2026-05-20T00:05:28.429982Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:28.429982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.18302","source_version":3,"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-20T00:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6bQ4/okko+pyDAx6hX/iam7C7EQWfeTk0b5tnp6UohLBzh2qaABI7tAdrtvOF3PLKVw2gglAGRQHALu97CVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:38:53.626170Z"},"content_sha256":"1b210e2194b6c6503d0d45c093ecb7b149defa391dd2cce675acc959930698c8","schema_version":"1.0","event_id":"sha256:1b210e2194b6c6503d0d45c093ecb7b149defa391dd2cce675acc959930698c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PR2JNKPS2XCLGUJRF7RPHP3DV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Treewidth Parameterized by Feedback Vertex Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Amit Zivan, Hendrik Molter, Meirav Zehavi","submitted_at":"2025-04-25T12:20:51Z","abstract_excerpt":"We provide the first algorithm for computing an optimal tree decomposition for a given graph $G$ that runs in single exponential time in the feedback vertex number of $G$, that is, in time $2^{O(\\text{fvn}(G))}\\cdot n^{O(1)}$, where $\\text{fvn}(G)$ is the feedback vertex number of $G$ and $n$ is the number of vertices of $G$. On a classification level, this improves the previously known results by Chapelle et al. [Discrete Applied Mathematics '17] and Fomin et al. [Algorithmica '18], who independently showed that an optimal tree decomposition can be computed in single exponential time in the v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18302","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.18302/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-20T00:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+eKiSBG2kxAMlBGAOf554mPXEFIpJTQCY58wcexQUOM5FpOXOuEqVhZX4zWppBDyUo1nqvYMQWQF8mGPTntDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:38:53.626965Z"},"content_sha256":"79a8ccf7ae2b3b327b09a6a757ab9ad534f1194eac001560ac1fecad61599f5b","schema_version":"1.0","event_id":"sha256:79a8ccf7ae2b3b327b09a6a757ab9ad534f1194eac001560ac1fecad61599f5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/bundle.json","state_url":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/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-05T22:38:53Z","links":{"resolver":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6","bundle":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/bundle.json","state":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PR2JNKPS2XCLGUJRF7RPHP3DV6","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":"cb25cad3f8faaa6d6a6aae3e0fb1090e7ca531a29eb139c98bce6e848b9ab6c6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-25T12:20:51Z","title_canon_sha256":"5fbe32297773e40e7d48247b87e8477ef21d06e61951a3b0bee8f65642fbd6e5"},"schema_version":"1.0","source":{"id":"2504.18302","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.18302","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"2504.18302v3","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18302","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"PR2JNKPS2XCL","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"pith_short_16","alias_value":"PR2JNKPS2XCLGUJR","created_at":"2026-05-20T00:05:28Z"},{"alias_kind":"pith_short_8","alias_value":"PR2JNKPS","created_at":"2026-05-20T00:05:28Z"}],"graph_snapshots":[{"event_id":"sha256:79a8ccf7ae2b3b327b09a6a757ab9ad534f1194eac001560ac1fecad61599f5b","target":"graph","created_at":"2026-05-20T00:05:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.18302/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide the first algorithm for computing an optimal tree decomposition for a given graph $G$ that runs in single exponential time in the feedback vertex number of $G$, that is, in time $2^{O(\\text{fvn}(G))}\\cdot n^{O(1)}$, where $\\text{fvn}(G)$ is the feedback vertex number of $G$ and $n$ is the number of vertices of $G$. On a classification level, this improves the previously known results by Chapelle et al. [Discrete Applied Mathematics '17] and Fomin et al. [Algorithmica '18], who independently showed that an optimal tree decomposition can be computed in single exponential time in the v","authors_text":"Amit Zivan, Hendrik Molter, Meirav Zehavi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-25T12:20:51Z","title":"Treewidth Parameterized by Feedback Vertex Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18302","kind":"arxiv","version":3},"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:1b210e2194b6c6503d0d45c093ecb7b149defa391dd2cce675acc959930698c8","target":"record","created_at":"2026-05-20T00:05:28Z","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":"cb25cad3f8faaa6d6a6aae3e0fb1090e7ca531a29eb139c98bce6e848b9ab6c6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-25T12:20:51Z","title_canon_sha256":"5fbe32297773e40e7d48247b87e8477ef21d06e61951a3b0bee8f65642fbd6e5"},"schema_version":"1.0","source":{"id":"2504.18302","kind":"arxiv","version":3}},"canonical_sha256":"7c7496a9f2d5c4b351312fe2f3bf63afbf1818d269fe52b9b222bdb35d30acd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c7496a9f2d5c4b351312fe2f3bf63afbf1818d269fe52b9b222bdb35d30acd5","first_computed_at":"2026-05-20T00:05:28.429982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:28.429982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"plhzrer+xnN67roiQ3hV8lpGaaSzyXJ1BZP06iHQ0X8tY2uyabP5sT02oUIaEYkdl+PC8XnwXsFGzJkuFLO6Dg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:28.430925Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.18302","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b210e2194b6c6503d0d45c093ecb7b149defa391dd2cce675acc959930698c8","sha256:79a8ccf7ae2b3b327b09a6a757ab9ad534f1194eac001560ac1fecad61599f5b"],"state_sha256":"6f71af152838ca0ae7babd9ec8d86d60591cc3d1bf8a7ecaf47e36d9a2131890"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lt3ioq/pyk1AwhDjHAETM8ayr00sWcHf9ZhB5BQWnyI4vKNJP81N4eBBgJCZODdTrbPibore/H2QUmbopBbPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:38:53.631480Z","bundle_sha256":"2dba79a337a2368c931ecc27140619f7bae5698e37b35f4f06c713a3d94e690c"}}