{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:47GPUBJDW4C5VNEZN4NQZOOCGN","short_pith_number":"pith:47GPUBJD","schema_version":"1.0","canonical_sha256":"e7ccfa0523b705dab4996f1b0cb9c23378b2c5f07857d8a685385764ddf9c1bb","source":{"kind":"arxiv","id":"2411.13171","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Geometric Graph Modification with Disk Scaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2024-11-20T10:10:23Z","abstract_excerpt":"The parameterized analysis of graph modification problems represents the most extensively studied area within Parameterized Complexity. Given a graph $G$ and an integer $k\\in\\mathbb{N}$ as input, the goal is to determine whether we can perform at most $k$ operations on $G$ to transform it into a graph belonging to a specified graph class $\\mathcal{F}$. Typical operations are combinatorial and include vertex deletions and edge deletions, insertions, and contractions. However, in many real-world scenarios, when the input graph is constrained to be a geometric intersection graph, the modification"},"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":"2411.13171","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-11-20T10:10:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0ea1e91507af3a0e4e652e60572b27db495e8b155d1459e1e284b78d2c119572","abstract_canon_sha256":"5f1f6655dff5e3cb93d531ce214eb7ff75681acedc3c7c15b51c292ac6b9ef08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:06.262590Z","signature_b64":"9Wk+LcRqwNu2MQHmadgGl9muyP38eQp4Fdua9tevCXYDPM+GhPuF9ymhTbuwSJw3JRhasvyDPejIKOF7YYhZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7ccfa0523b705dab4996f1b0cb9c23378b2c5f07857d8a685385764ddf9c1bb","last_reissued_at":"2026-07-05T09:38:06.262115Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:06.262115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Geometric Graph Modification with Disk Scaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2024-11-20T10:10:23Z","abstract_excerpt":"The parameterized analysis of graph modification problems represents the most extensively studied area within Parameterized Complexity. Given a graph $G$ and an integer $k\\in\\mathbb{N}$ as input, the goal is to determine whether we can perform at most $k$ operations on $G$ to transform it into a graph belonging to a specified graph class $\\mathcal{F}$. Typical operations are combinatorial and include vertex deletions and edge deletions, insertions, and contractions. However, in many real-world scenarios, when the input graph is constrained to be a geometric intersection graph, the modification"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13171","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/2411.13171/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":"2411.13171","created_at":"2026-07-05T09:38:06.262171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13171v1","created_at":"2026-07-05T09:38:06.262171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13171","created_at":"2026-07-05T09:38:06.262171+00:00"},{"alias_kind":"pith_short_12","alias_value":"47GPUBJDW4C5","created_at":"2026-07-05T09:38:06.262171+00:00"},{"alias_kind":"pith_short_16","alias_value":"47GPUBJDW4C5VNEZ","created_at":"2026-07-05T09:38:06.262171+00:00"},{"alias_kind":"pith_short_8","alias_value":"47GPUBJD","created_at":"2026-07-05T09:38:06.262171+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/47GPUBJDW4C5VNEZN4NQZOOCGN","json":"https://pith.science/pith/47GPUBJDW4C5VNEZN4NQZOOCGN.json","graph_json":"https://pith.science/api/pith-number/47GPUBJDW4C5VNEZN4NQZOOCGN/graph.json","events_json":"https://pith.science/api/pith-number/47GPUBJDW4C5VNEZN4NQZOOCGN/events.json","paper":"https://pith.science/paper/47GPUBJD"},"agent_actions":{"view_html":"https://pith.science/pith/47GPUBJDW4C5VNEZN4NQZOOCGN","download_json":"https://pith.science/pith/47GPUBJDW4C5VNEZN4NQZOOCGN.json","view_paper":"https://pith.science/paper/47GPUBJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13171&json=true","fetch_graph":"https://pith.science/api/pith-number/47GPUBJDW4C5VNEZN4NQZOOCGN/graph.json","fetch_events":"https://pith.science/api/pith-number/47GPUBJDW4C5VNEZN4NQZOOCGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47GPUBJDW4C5VNEZN4NQZOOCGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47GPUBJDW4C5VNEZN4NQZOOCGN/action/storage_attestation","attest_author":"https://pith.science/pith/47GPUBJDW4C5VNEZN4NQZOOCGN/action/author_attestation","sign_citation":"https://pith.science/pith/47GPUBJDW4C5VNEZN4NQZOOCGN/action/citation_signature","submit_replication":"https://pith.science/pith/47GPUBJDW4C5VNEZN4NQZOOCGN/action/replication_record"}},"created_at":"2026-07-05T09:38:06.262171+00:00","updated_at":"2026-07-05T09:38:06.262171+00:00"}