{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UO7LME57LEWVZC3DVGA26CAUZH","short_pith_number":"pith:UO7LME57","schema_version":"1.0","canonical_sha256":"a3beb613bf592d5c8b63a981af0814c9e9535aaf4593b7bdd7916f79869f16dc","source":{"kind":"arxiv","id":"2402.18352","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrea Munaro, Esther Galby, Shizhou Yang","submitted_at":"2024-02-28T14:20:29Z","abstract_excerpt":"We investigate a relaxation of the notion of fractional treewidth-fragility, namely fractional tree-independence-number-fragility. In particular, we obtain polynomial-time approximation schemes for meta-problems such as finding a maximum-weight sparse induced subgraph satisfying a given $\\mathsf{CMSO}_2$ formula on fractionally tree-independence-number-fragile graph classes. Our approach unifies and extends several known polynomial-time approximation schemes on seemingly unrelated graph classes, such as classes of intersection graphs of fat objects in a fixed dimension or proper minor-closed c"},"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":"2402.18352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-28T14:20:29Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"06e627ef9f656706ddf2787b8c51e60cb09ba710971d5b72a8cd642cadc11331","abstract_canon_sha256":"58b09ece46ce7f147ba5581424e41bf2b0e5097f3b133e9e1dd3e59562a5a297"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:10.706142Z","signature_b64":"rgJCiF3/wpdWRhiPxvvtTHGnO7THCNSjGk08i36Os8beL4Oc/kjxl/cr4NuiAJoq8bKCAVW1KUr5+q/vt/yUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3beb613bf592d5c8b63a981af0814c9e9535aaf4593b7bdd7916f79869f16dc","last_reissued_at":"2026-07-05T10:52:10.705650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:10.705650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrea Munaro, Esther Galby, Shizhou Yang","submitted_at":"2024-02-28T14:20:29Z","abstract_excerpt":"We investigate a relaxation of the notion of fractional treewidth-fragility, namely fractional tree-independence-number-fragility. In particular, we obtain polynomial-time approximation schemes for meta-problems such as finding a maximum-weight sparse induced subgraph satisfying a given $\\mathsf{CMSO}_2$ formula on fractionally tree-independence-number-fragile graph classes. Our approach unifies and extends several known polynomial-time approximation schemes on seemingly unrelated graph classes, such as classes of intersection graphs of fat objects in a fixed dimension or proper minor-closed c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18352","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.18352/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":"2402.18352","created_at":"2026-07-05T10:52:10.705710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.18352v1","created_at":"2026-07-05T10:52:10.705710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18352","created_at":"2026-07-05T10:52:10.705710+00:00"},{"alias_kind":"pith_short_12","alias_value":"UO7LME57LEWV","created_at":"2026-07-05T10:52:10.705710+00:00"},{"alias_kind":"pith_short_16","alias_value":"UO7LME57LEWVZC3D","created_at":"2026-07-05T10:52:10.705710+00:00"},{"alias_kind":"pith_short_8","alias_value":"UO7LME57","created_at":"2026-07-05T10:52:10.705710+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04659","citing_title":"Subdivided expanders and counterexamples to the Tree Product Conjecture","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH","json":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH.json","graph_json":"https://pith.science/api/pith-number/UO7LME57LEWVZC3DVGA26CAUZH/graph.json","events_json":"https://pith.science/api/pith-number/UO7LME57LEWVZC3DVGA26CAUZH/events.json","paper":"https://pith.science/paper/UO7LME57"},"agent_actions":{"view_html":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH","download_json":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH.json","view_paper":"https://pith.science/paper/UO7LME57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.18352&json=true","fetch_graph":"https://pith.science/api/pith-number/UO7LME57LEWVZC3DVGA26CAUZH/graph.json","fetch_events":"https://pith.science/api/pith-number/UO7LME57LEWVZC3DVGA26CAUZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/action/storage_attestation","attest_author":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/action/author_attestation","sign_citation":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/action/citation_signature","submit_replication":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/action/replication_record"}},"created_at":"2026-07-05T10:52:10.705710+00:00","updated_at":"2026-07-05T10:52:10.705710+00:00"}