{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NY7AKKV2AHZSRFJSIMSFRURL6U","short_pith_number":"pith:NY7AKKV2","canonical_record":{"source":{"id":"2107.06715","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T14:01:25Z","cross_cats_sorted":[],"title_canon_sha256":"90b1743287c4f34a30a3faa1b6ace616d5f9b0db41f46564e92a1e8d20043f69","abstract_canon_sha256":"adafdb0b7ff86880364d9bdc21ff5de00a575ab204814825c55a1fd98394aa81"},"schema_version":"1.0"},"canonical_sha256":"6e3e052aba01f3289532432458d22bf534f475f7c1ec07a7f5122f8691f83209","source":{"kind":"arxiv","id":"2107.06715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06715","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06715v1","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06715","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"NY7AKKV2AHZS","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"pith_short_16","alias_value":"NY7AKKV2AHZSRFJS","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"pith_short_8","alias_value":"NY7AKKV2","created_at":"2026-07-05T02:58:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NY7AKKV2AHZSRFJSIMSFRURL6U","target":"record","payload":{"canonical_record":{"source":{"id":"2107.06715","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T14:01:25Z","cross_cats_sorted":[],"title_canon_sha256":"90b1743287c4f34a30a3faa1b6ace616d5f9b0db41f46564e92a1e8d20043f69","abstract_canon_sha256":"adafdb0b7ff86880364d9bdc21ff5de00a575ab204814825c55a1fd98394aa81"},"schema_version":"1.0"},"canonical_sha256":"6e3e052aba01f3289532432458d22bf534f475f7c1ec07a7f5122f8691f83209","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:00.704586Z","signature_b64":"2x42uQuTsV8C0wjExO39RecL5VJBjLnviiOQ+mdhLAVRfNWuJ6Te5vbMFb1MY8L8KPn9rE2mHRtdFkQU1/mBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e3e052aba01f3289532432458d22bf534f475f7c1ec07a7f5122f8691f83209","last_reissued_at":"2026-07-05T02:58:00.704023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:00.704023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.06715","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-05T02:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ad5YqLp6U5whHBfaioxwvXNlUEGIeyPS2Kn2Ca+Qv0903FEGA3Su5z0/VSycV+SaUj51Joeb7ObRnZ1t03U3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:02:22.587206Z"},"content_sha256":"d53b6d05185262368b2c837302b3aa0e3b368ac1f37390c6a7c4b5f887a53357","schema_version":"1.0","event_id":"sha256:d53b6d05185262368b2c837302b3aa0e3b368ac1f37390c6a7c4b5f887a53357"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NY7AKKV2AHZSRFJSIMSFRURL6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2021-07-14T14:01:25Z","abstract_excerpt":"De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dynamic programming on graphs of weighted treewidth resulting in algorithms that use super-polynomial space. We introduce the notion of weighted treedepth and use it to refine the framework of de Berg et al. for obtaining polynomial space (with tight running times) on geometric graphs. As a result, we prove that for any fixed dimension $d \\ge 2$ on intersection graphs of similarly-sized fat objects many well-known graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06715","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/2107.06715/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-05T02:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjqNyYAMOTy9r9tnMSN2Eeyh08SgzdvcjSM0tUtQmifmhj8etrinmPT5g9k213T1gAXIZLcJRxRZvv+PtfxOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:02:22.587982Z"},"content_sha256":"78cb4d7978758a8ad5b477ec89806ee9d9d1b283ab9f6a9fff043227a1bd7a72","schema_version":"1.0","event_id":"sha256:78cb4d7978758a8ad5b477ec89806ee9d9d1b283ab9f6a9fff043227a1bd7a72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NY7AKKV2AHZSRFJSIMSFRURL6U/bundle.json","state_url":"https://pith.science/pith/NY7AKKV2AHZSRFJSIMSFRURL6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NY7AKKV2AHZSRFJSIMSFRURL6U/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-14T09:02:22Z","links":{"resolver":"https://pith.science/pith/NY7AKKV2AHZSRFJSIMSFRURL6U","bundle":"https://pith.science/pith/NY7AKKV2AHZSRFJSIMSFRURL6U/bundle.json","state":"https://pith.science/pith/NY7AKKV2AHZSRFJSIMSFRURL6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NY7AKKV2AHZSRFJSIMSFRURL6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NY7AKKV2AHZSRFJSIMSFRURL6U","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":"adafdb0b7ff86880364d9bdc21ff5de00a575ab204814825c55a1fd98394aa81","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T14:01:25Z","title_canon_sha256":"90b1743287c4f34a30a3faa1b6ace616d5f9b0db41f46564e92a1e8d20043f69"},"schema_version":"1.0","source":{"id":"2107.06715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06715","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06715v1","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06715","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"NY7AKKV2AHZS","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"pith_short_16","alias_value":"NY7AKKV2AHZSRFJS","created_at":"2026-07-05T02:58:00Z"},{"alias_kind":"pith_short_8","alias_value":"NY7AKKV2","created_at":"2026-07-05T02:58:00Z"}],"graph_snapshots":[{"event_id":"sha256:78cb4d7978758a8ad5b477ec89806ee9d9d1b283ab9f6a9fff043227a1bd7a72","target":"graph","created_at":"2026-07-05T02:58:00Z","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/2107.06715/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dynamic programming on graphs of weighted treewidth resulting in algorithms that use super-polynomial space. We introduce the notion of weighted treedepth and use it to refine the framework of de Berg et al. for obtaining polynomial space (with tight running times) on geometric graphs. As a result, we prove that for any fixed dimension $d \\ge 2$ on intersection graphs of similarly-sized fat objects many well-known graph","authors_text":"Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T14:01:25Z","title":"ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06715","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:d53b6d05185262368b2c837302b3aa0e3b368ac1f37390c6a7c4b5f887a53357","target":"record","created_at":"2026-07-05T02:58:00Z","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":"adafdb0b7ff86880364d9bdc21ff5de00a575ab204814825c55a1fd98394aa81","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T14:01:25Z","title_canon_sha256":"90b1743287c4f34a30a3faa1b6ace616d5f9b0db41f46564e92a1e8d20043f69"},"schema_version":"1.0","source":{"id":"2107.06715","kind":"arxiv","version":1}},"canonical_sha256":"6e3e052aba01f3289532432458d22bf534f475f7c1ec07a7f5122f8691f83209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e3e052aba01f3289532432458d22bf534f475f7c1ec07a7f5122f8691f83209","first_computed_at":"2026-07-05T02:58:00.704023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:58:00.704023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2x42uQuTsV8C0wjExO39RecL5VJBjLnviiOQ+mdhLAVRfNWuJ6Te5vbMFb1MY8L8KPn9rE2mHRtdFkQU1/mBAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:58:00.704586Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.06715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d53b6d05185262368b2c837302b3aa0e3b368ac1f37390c6a7c4b5f887a53357","sha256:78cb4d7978758a8ad5b477ec89806ee9d9d1b283ab9f6a9fff043227a1bd7a72"],"state_sha256":"d5c7ef9e3bebc754e9cf0e00ce191959b4a724f58366c9d0af2d8496c41094f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMZWe5CJU58bfH7LbYzVW1dsF3qHXH+HHbKAicAteK/j/JhkEpMLuKkGcpquuDcU1HbxQ3i/L5iYee3n0En2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:02:22.593939Z","bundle_sha256":"7f2d49f652ae217de98ae4c74364de02cbd5eb6d7f6f82523305dae9a0c392bb"}}