{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S7SJJZI5426DEHGM4WPY7ZUHC4","short_pith_number":"pith:S7SJJZI5","canonical_record":{"source":{"id":"1501.00721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-04T21:04:08Z","cross_cats_sorted":[],"title_canon_sha256":"25e17c06694d06f54e92c1af8f8c026f0f0f7b6af65a05cf11aea5d6d05be30d","abstract_canon_sha256":"0f9af14204d192b0cdbaa622151fa045b2a54d7141c3ecb54857710a21d13d82"},"schema_version":"1.0"},"canonical_sha256":"97e494e51de6bc321ccce59f8fe6871716c747cd52acaa41e334fd927e0374f3","source":{"kind":"arxiv","id":"1501.00721","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00721","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00721v2","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00721","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"S7SJJZI5426D","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S7SJJZI5426DEHGM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S7SJJZI5","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S7SJJZI5426DEHGM4WPY7ZUHC4","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-04T21:04:08Z","cross_cats_sorted":[],"title_canon_sha256":"25e17c06694d06f54e92c1af8f8c026f0f0f7b6af65a05cf11aea5d6d05be30d","abstract_canon_sha256":"0f9af14204d192b0cdbaa622151fa045b2a54d7141c3ecb54857710a21d13d82"},"schema_version":"1.0"},"canonical_sha256":"97e494e51de6bc321ccce59f8fe6871716c747cd52acaa41e334fd927e0374f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:16.901886Z","signature_b64":"/48yNtq5ey/JR/fA4b8HsOGWOvqlKLhngucXPtwf3L81QcklUkMuQ3U0+29KD1ErAsQEdfNGupemhIy1hN+TBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e494e51de6bc321ccce59f8fe6871716c747cd52acaa41e334fd927e0374f3","last_reissued_at":"2026-05-18T01:13:16.901455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:16.901455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00721","source_version":2,"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-05-18T01:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/CKGzPH1ae0tpCvzb8lgEcXtSlsk8c+XUGXcH8TuUen+LG7/WylQH22ANw45j9XVBXgPWTwdTitRPfGwgvLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T20:00:16.844795Z"},"content_sha256":"65b853783107d54876d88d8ab16222ed3281aad070d0c7c20c466a3793160a9b","schema_version":"1.0","event_id":"sha256:65b853783107d54876d88d8ab16222ed3281aad070d0c7c20c466a3793160a9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S7SJJZI5426DEHGM4WPY7ZUHC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kent Quanrud, Sariel Har-Peled","submitted_at":"2015-01-04T21:04:08Z","abstract_excerpt":"We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient $(1+\\varepsilon)$-approximation algorithms for these graphs, for Independent Set, Set Cover, and Dominating Set problems, among others. We also prove corresponding hardness of approximation for some of these optimization problems, providing a characterization of their intractability in terms of density."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00721","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T01:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NlqmEFQBkXECBy4h9QJDKJs2LxsXOFf7hdhJuI4L6mbC57oo93ezUechT3lRvZjsxSSVuiBLOhs4rI5V18pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T20:00:16.845542Z"},"content_sha256":"a9ce11d4c8b34972764d1913bd66f6dcd67d60861be1ea016ba5c5561a489f8a","schema_version":"1.0","event_id":"sha256:a9ce11d4c8b34972764d1913bd66f6dcd67d60861be1ea016ba5c5561a489f8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7SJJZI5426DEHGM4WPY7ZUHC4/bundle.json","state_url":"https://pith.science/pith/S7SJJZI5426DEHGM4WPY7ZUHC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7SJJZI5426DEHGM4WPY7ZUHC4/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-06-09T20:00:16Z","links":{"resolver":"https://pith.science/pith/S7SJJZI5426DEHGM4WPY7ZUHC4","bundle":"https://pith.science/pith/S7SJJZI5426DEHGM4WPY7ZUHC4/bundle.json","state":"https://pith.science/pith/S7SJJZI5426DEHGM4WPY7ZUHC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7SJJZI5426DEHGM4WPY7ZUHC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S7SJJZI5426DEHGM4WPY7ZUHC4","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":"0f9af14204d192b0cdbaa622151fa045b2a54d7141c3ecb54857710a21d13d82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-04T21:04:08Z","title_canon_sha256":"25e17c06694d06f54e92c1af8f8c026f0f0f7b6af65a05cf11aea5d6d05be30d"},"schema_version":"1.0","source":{"id":"1501.00721","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00721","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00721v2","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00721","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"S7SJJZI5426D","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S7SJJZI5426DEHGM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S7SJJZI5","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:a9ce11d4c8b34972764d1913bd66f6dcd67d60861be1ea016ba5c5561a489f8a","target":"graph","created_at":"2026-05-18T01:13:16Z","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"},"paper":{"abstract_excerpt":"We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient $(1+\\varepsilon)$-approximation algorithms for these graphs, for Independent Set, Set Cover, and Dominating Set problems, among others. We also prove corresponding hardness of approximation for some of these optimization problems, providing a characterization of their intractability in terms of density.","authors_text":"Kent Quanrud, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-04T21:04:08Z","title":"Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00721","kind":"arxiv","version":2},"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:65b853783107d54876d88d8ab16222ed3281aad070d0c7c20c466a3793160a9b","target":"record","created_at":"2026-05-18T01:13:16Z","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":"0f9af14204d192b0cdbaa622151fa045b2a54d7141c3ecb54857710a21d13d82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-04T21:04:08Z","title_canon_sha256":"25e17c06694d06f54e92c1af8f8c026f0f0f7b6af65a05cf11aea5d6d05be30d"},"schema_version":"1.0","source":{"id":"1501.00721","kind":"arxiv","version":2}},"canonical_sha256":"97e494e51de6bc321ccce59f8fe6871716c747cd52acaa41e334fd927e0374f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97e494e51de6bc321ccce59f8fe6871716c747cd52acaa41e334fd927e0374f3","first_computed_at":"2026-05-18T01:13:16.901455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:16.901455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/48yNtq5ey/JR/fA4b8HsOGWOvqlKLhngucXPtwf3L81QcklUkMuQ3U0+29KD1ErAsQEdfNGupemhIy1hN+TBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:16.901886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00721","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65b853783107d54876d88d8ab16222ed3281aad070d0c7c20c466a3793160a9b","sha256:a9ce11d4c8b34972764d1913bd66f6dcd67d60861be1ea016ba5c5561a489f8a"],"state_sha256":"985070e1bc46e4eb19ccd401f4dc3f0ec57f80b3ba6108bbde2a248ca238c544"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZAl8YLZTvfx0ZWg0kA9zl8UE4g3qSdszZZYIsr0K8KhKMA2G11hg8HS5yaSQevVoQEhQuRmNJpGr42ouKbSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T20:00:16.849815Z","bundle_sha256":"f5f1ad345546f525bad13ce1303906560ad4287b9af2d79391661779751200cc"}}