{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PR2JNKPS2XCLGUJRF7RPHP3DV6","short_pith_number":"pith:PR2JNKPS","schema_version":"1.0","canonical_sha256":"7c7496a9f2d5c4b351312fe2f3bf63afbf1818d269fe52b9b222bdb35d30acd5","source":{"kind":"arxiv","id":"2504.18302","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.18302","created_at":"2026-05-20T00:05:28.430134+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.18302v3","created_at":"2026-05-20T00:05:28.430134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18302","created_at":"2026-05-20T00:05:28.430134+00:00"},{"alias_kind":"pith_short_12","alias_value":"PR2JNKPS2XCL","created_at":"2026-05-20T00:05:28.430134+00:00"},{"alias_kind":"pith_short_16","alias_value":"PR2JNKPS2XCLGUJR","created_at":"2026-05-20T00:05:28.430134+00:00"},{"alias_kind":"pith_short_8","alias_value":"PR2JNKPS","created_at":"2026-05-20T00:05:28.430134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6","json":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6.json","graph_json":"https://pith.science/api/pith-number/PR2JNKPS2XCLGUJRF7RPHP3DV6/graph.json","events_json":"https://pith.science/api/pith-number/PR2JNKPS2XCLGUJRF7RPHP3DV6/events.json","paper":"https://pith.science/paper/PR2JNKPS"},"agent_actions":{"view_html":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6","download_json":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6.json","view_paper":"https://pith.science/paper/PR2JNKPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.18302&json=true","fetch_graph":"https://pith.science/api/pith-number/PR2JNKPS2XCLGUJRF7RPHP3DV6/graph.json","fetch_events":"https://pith.science/api/pith-number/PR2JNKPS2XCLGUJRF7RPHP3DV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/action/storage_attestation","attest_author":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/action/author_attestation","sign_citation":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/action/citation_signature","submit_replication":"https://pith.science/pith/PR2JNKPS2XCLGUJRF7RPHP3DV6/action/replication_record"}},"created_at":"2026-05-20T00:05:28.430134+00:00","updated_at":"2026-05-20T00:05:28.430134+00:00"}