{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UO7LME57LEWVZC3DVGA26CAUZH","short_pith_number":"pith:UO7LME57","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"},"canonical_sha256":"a3beb613bf592d5c8b63a981af0814c9e9535aaf4593b7bdd7916f79869f16dc","source":{"kind":"arxiv","id":"2402.18352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.18352","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"arxiv_version","alias_value":"2402.18352v1","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18352","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_12","alias_value":"UO7LME57LEWV","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_16","alias_value":"UO7LME57LEWVZC3D","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_8","alias_value":"UO7LME57","created_at":"2026-07-05T10:52:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UO7LME57LEWVZC3DVGA26CAUZH","target":"record","payload":{"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"},"canonical_sha256":"a3beb613bf592d5c8b63a981af0814c9e9535aaf4593b7bdd7916f79869f16dc","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"},"source_kind":"arxiv","source_id":"2402.18352","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-07-05T10:52:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ph3rf7jNViYypOvFF1IoyfvgiBxDHCvN2bFS4/R/a383eFaOLXNkYYwC8bspV7qB5V8J+rz6u5xmNlai+b5cCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:16:36.505391Z"},"content_sha256":"a6ca241ed1e2341c093c41eee50c998b1d5922842c85b4b2faabca88b51bcdca","schema_version":"1.0","event_id":"sha256:a6ca241ed1e2341c093c41eee50c998b1d5922842c85b4b2faabca88b51bcdca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UO7LME57LEWVZC3DVGA26CAUZH","target":"graph","payload":{"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"},"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-07-05T10:52:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXg2k6KrtEOil0q91cFdVpoZ6gZxjX0riCLdhfDs4nUN2Rpom+hwoxl4cWcpAtWGLBZmtFHg+6PtRn51+VmyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:16:36.505915Z"},"content_sha256":"8fd66d3d402fb1ea2bfac3ca8755b1b444a4ea11daa6bf6253c975f68655d579","schema_version":"1.0","event_id":"sha256:8fd66d3d402fb1ea2bfac3ca8755b1b444a4ea11daa6bf6253c975f68655d579"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/bundle.json","state_url":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UO7LME57LEWVZC3DVGA26CAUZH/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-08-15T13:16:36Z","links":{"resolver":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH","bundle":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/bundle.json","state":"https://pith.science/pith/UO7LME57LEWVZC3DVGA26CAUZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UO7LME57LEWVZC3DVGA26CAUZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UO7LME57LEWVZC3DVGA26CAUZH","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":"58b09ece46ce7f147ba5581424e41bf2b0e5097f3b133e9e1dd3e59562a5a297","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-28T14:20:29Z","title_canon_sha256":"06e627ef9f656706ddf2787b8c51e60cb09ba710971d5b72a8cd642cadc11331"},"schema_version":"1.0","source":{"id":"2402.18352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.18352","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"arxiv_version","alias_value":"2402.18352v1","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18352","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_12","alias_value":"UO7LME57LEWV","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_16","alias_value":"UO7LME57LEWVZC3D","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_8","alias_value":"UO7LME57","created_at":"2026-07-05T10:52:10Z"}],"graph_snapshots":[{"event_id":"sha256:8fd66d3d402fb1ea2bfac3ca8755b1b444a4ea11daa6bf6253c975f68655d579","target":"graph","created_at":"2026-07-05T10:52:10Z","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/2402.18352/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrea Munaro, Esther Galby, Shizhou Yang","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-28T14:20:29Z","title":"Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18352","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:a6ca241ed1e2341c093c41eee50c998b1d5922842c85b4b2faabca88b51bcdca","target":"record","created_at":"2026-07-05T10:52:10Z","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":"58b09ece46ce7f147ba5581424e41bf2b0e5097f3b133e9e1dd3e59562a5a297","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-28T14:20:29Z","title_canon_sha256":"06e627ef9f656706ddf2787b8c51e60cb09ba710971d5b72a8cd642cadc11331"},"schema_version":"1.0","source":{"id":"2402.18352","kind":"arxiv","version":1}},"canonical_sha256":"a3beb613bf592d5c8b63a981af0814c9e9535aaf4593b7bdd7916f79869f16dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3beb613bf592d5c8b63a981af0814c9e9535aaf4593b7bdd7916f79869f16dc","first_computed_at":"2026-07-05T10:52:10.705650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:10.705650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rgJCiF3/wpdWRhiPxvvtTHGnO7THCNSjGk08i36Os8beL4Oc/kjxl/cr4NuiAJoq8bKCAVW1KUr5+q/vt/yUAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:10.706142Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.18352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6ca241ed1e2341c093c41eee50c998b1d5922842c85b4b2faabca88b51bcdca","sha256:8fd66d3d402fb1ea2bfac3ca8755b1b444a4ea11daa6bf6253c975f68655d579"],"state_sha256":"9708119c17fedcda11e442bc9f15cd408670740e8571365a09486affefe86975"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNB+mtJrc9fUvvbaQm6Slx/QZ8sY80VKuQCwaq/RNRRaoNzWf1NXnWGrZ+EPnbxDVxJWe2sUHFYwWp4CgZ86AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:16:36.517592Z","bundle_sha256":"99eaa73c03a5d2391390105342cec231ff4ece780ae4222f773e7f1033e070c5"}}