{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ET4T66X6RLQRX3IAACMPGAJN3O","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":"c6c7b90a4f2f68c3364c7dcdf20739ec5c87ac9593757bf42732e01d9717ebe9","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-05-21T16:12:39Z","title_canon_sha256":"5fc0467f08dfa819b65791daa97f5ec5a4d15d6474303339c249e01b2cfcb424"},"schema_version":"1.0","source":{"id":"2505.15699","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.15699","created_at":"2026-06-19T16:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2505.15699v5","created_at":"2026-06-19T16:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15699","created_at":"2026-06-19T16:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"ET4T66X6RLQR","created_at":"2026-06-19T16:09:49Z"},{"alias_kind":"pith_short_16","alias_value":"ET4T66X6RLQRX3IA","created_at":"2026-06-19T16:09:49Z"},{"alias_kind":"pith_short_8","alias_value":"ET4T66X6","created_at":"2026-06-19T16:09:49Z"}],"graph_snapshots":[{"event_id":"sha256:999b1c901cc4ca646bac62474efd0eb779724b7aea20abdd684e5e38ec91b345","target":"graph","created_at":"2026-06-19T16:09:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We provide meta-algorithms for both VIM and TIM width which can be used to prove fixed-parameter-tractability for large families of problems, bypassing the need to give involved dynamic programming arguments for every problem. We provide a characterisation of problems in FPT with respect to both parameters."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the temporal problems under consideration admit dynamic programming solutions whose state at each time step depends only on a bounded number of vertices or substructures whose size is controlled by the VIM or TIM width (as defined in the paper)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Introduces TIM width generalizing VIM width and gives meta-algorithms that characterize FPT problems including temporal Hamiltonian path and dominating set."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Meta-algorithms for vertex-interval-membership and tree-interval-membership widths prove fixed-parameter tractability for large families of temporal graph problems."}],"snapshot_sha256":"a6ae691ce1ebd213ea82f2d6d2f8d089c05b4b1bc0dd524ad1967d78c7eec1e8"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.15699/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Temporal graphs are graphs whose edges are labelled with times at which they are active. Their time-sensitivity provides a useful model of real networks, but renders many problems studied on temporal graphs more computationally complex than their static counterparts. To contend with this, there has been recent work devising parameters for which temporal problems become tractable. One such parameter is vertex-interval-membership (VIM) width. Broadly, this gives a bound on the number of vertices we need to keep track of at any given time to solve many problems. Our contributions are two-fold. Fi","authors_text":"Jessica Enright, Kitty Meeks, Laura Larios-Jones, Samuel D. Hand","cross_cats":["math.CO"],"headline":"Meta-algorithms for vertex-interval-membership and tree-interval-membership widths prove fixed-parameter tractability for large families of temporal graph problems.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-05-21T16:12:39Z","title":"Families of tractable problems with respect to vertex-interval-membership width and its generalisations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15699","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-22T13:54:37.920533Z","id":"11d12ac4-fc40-4024-90eb-cc9609c312f0","model_set":{"reader":"grok-4.3"},"one_line_summary":"Introduces TIM width generalizing VIM width and gives meta-algorithms that characterize FPT problems including temporal Hamiltonian path and dominating set.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Meta-algorithms for vertex-interval-membership and tree-interval-membership widths prove fixed-parameter tractability for large families of temporal graph problems.","strongest_claim":"We provide meta-algorithms for both VIM and TIM width which can be used to prove fixed-parameter-tractability for large families of problems, bypassing the need to give involved dynamic programming arguments for every problem. We provide a characterisation of problems in FPT with respect to both parameters.","weakest_assumption":"That the temporal problems under consideration admit dynamic programming solutions whose state at each time step depends only on a bounded number of vertices or substructures whose size is controlled by the VIM or TIM width (as defined in the paper)."}},"verdict_id":"11d12ac4-fc40-4024-90eb-cc9609c312f0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a0bf848ce651ea8d8e3f264e0b4c611faea744a034deaa1439db612d1d3b5a8e","target":"record","created_at":"2026-06-19T16:09:49Z","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":"c6c7b90a4f2f68c3364c7dcdf20739ec5c87ac9593757bf42732e01d9717ebe9","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-05-21T16:12:39Z","title_canon_sha256":"5fc0467f08dfa819b65791daa97f5ec5a4d15d6474303339c249e01b2cfcb424"},"schema_version":"1.0","source":{"id":"2505.15699","kind":"arxiv","version":5}},"canonical_sha256":"24f93f7afe8ae11bed000098f3012ddbbb4948a1a8017aa66faa3b33c691fd43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24f93f7afe8ae11bed000098f3012ddbbb4948a1a8017aa66faa3b33c691fd43","first_computed_at":"2026-06-19T16:09:49.303880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:49.303880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m57jlWvSu7GQJb7NYoFuFa7kR55OtzsyOayNp4cVcx3ThEkFIAegtgBeyi76q7aHwugUY7G50LjE7VF9gHVFBA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:49.304263Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.15699","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0bf848ce651ea8d8e3f264e0b4c611faea744a034deaa1439db612d1d3b5a8e","sha256:999b1c901cc4ca646bac62474efd0eb779724b7aea20abdd684e5e38ec91b345"],"state_sha256":"01b31521a3ebfa59ed181fdbe3bd0874eb87271ff8373b20ccda3d9260f84b26"}