{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZTT6QYLN7HKK5O3KTUUZLKHRC2","short_pith_number":"pith:ZTT6QYLN","canonical_record":{"source":{"id":"1806.02771","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-07T16:39:17Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"b8f63ae032d58580d95420ff96f82f5fe1923351359846fe28a7080f5c3d0fc7","abstract_canon_sha256":"499eaac92d022561b09021172b293b7961b7726479dff7e2971c7dc9aa9f7b9b"},"schema_version":"1.0"},"canonical_sha256":"cce7e8616df9d4aebb6a9d2995a8f116b0ba69d07b4ce1a929d73cb789015668","source":{"kind":"arxiv","id":"1806.02771","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02771","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02771v3","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02771","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZTT6QYLN7HKK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTT6QYLN7HKK5O3K","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTT6QYLN","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZTT6QYLN7HKK5O3KTUUZLKHRC2","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02771","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-07T16:39:17Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"b8f63ae032d58580d95420ff96f82f5fe1923351359846fe28a7080f5c3d0fc7","abstract_canon_sha256":"499eaac92d022561b09021172b293b7961b7726479dff7e2971c7dc9aa9f7b9b"},"schema_version":"1.0"},"canonical_sha256":"cce7e8616df9d4aebb6a9d2995a8f116b0ba69d07b4ce1a929d73cb789015668","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:47.934169Z","signature_b64":"760fhq1jUk9qICj+VsFx0M94CNnDQKlBMC50B4DV6bPVWVW8Mp7xoSlzJUE/WfSMENH0qE5By+6tQDixMIdvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cce7e8616df9d4aebb6a9d2995a8f116b0ba69d07b4ce1a929d73cb789015668","last_reissued_at":"2026-05-17T23:58:47.933765Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:47.933765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02771","source_version":3,"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-17T23:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ax51WTz7nn9Yoa6byAIIpmiUNFPUrmtGOKxPC+m+Nl3WIem1muEoaMcGy5FRUtGm047OMRKdrWd+O37Ct6dgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:05:25.679132Z"},"content_sha256":"d3102f12760a5460a8ac12a7dfa00c16bd3446f04c73c953c9fd6dd5154fbe12","schema_version":"1.0","event_id":"sha256:d3102f12760a5460a8ac12a7dfa00c16bd3446f04c73c953c9fd6dd5154fbe12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZTT6QYLN7HKK5O3KTUUZLKHRC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Ali Vakilian, Andrew van der Poel, Blair D. Sullivan, Brian Lavallee, Erik D. Demaine, Kyle Kloster, Quanquan C. Liu, Timothy D. Goodrich","submitted_at":"2018-06-07T16:39:17Z","abstract_excerpt":"We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world networks) while still guaranteeing approximation ratios. The idea is to $\\textit{edit}$ a given graph via vertex- or edge-deletions to put the graph into an algorithmically tractable class, apply known approximation algorithms for that class, and then $\\textit{lift}$ the solution to apply to the original graph. We give a general characterization of when an optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02771","kind":"arxiv","version":3},"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-17T23:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcjoWTMhdY5VkQsh4nAlgYwWKbvfc8Qtp7S18FUVVr0jZpubdrY2mFXN7dk7khMgun5LWdfhBoijO5GyUEN1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:05:25.679525Z"},"content_sha256":"0830bce7554785adbf413927a849ff898c4bb99d7ae6c4b42b88d4faf1a146cb","schema_version":"1.0","event_id":"sha256:0830bce7554785adbf413927a849ff898c4bb99d7ae6c4b42b88d4faf1a146cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTT6QYLN7HKK5O3KTUUZLKHRC2/bundle.json","state_url":"https://pith.science/pith/ZTT6QYLN7HKK5O3KTUUZLKHRC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTT6QYLN7HKK5O3KTUUZLKHRC2/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-02T14:05:25Z","links":{"resolver":"https://pith.science/pith/ZTT6QYLN7HKK5O3KTUUZLKHRC2","bundle":"https://pith.science/pith/ZTT6QYLN7HKK5O3KTUUZLKHRC2/bundle.json","state":"https://pith.science/pith/ZTT6QYLN7HKK5O3KTUUZLKHRC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTT6QYLN7HKK5O3KTUUZLKHRC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZTT6QYLN7HKK5O3KTUUZLKHRC2","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":"499eaac92d022561b09021172b293b7961b7726479dff7e2971c7dc9aa9f7b9b","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-07T16:39:17Z","title_canon_sha256":"b8f63ae032d58580d95420ff96f82f5fe1923351359846fe28a7080f5c3d0fc7"},"schema_version":"1.0","source":{"id":"1806.02771","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02771","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02771v3","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02771","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZTT6QYLN7HKK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTT6QYLN7HKK5O3K","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTT6QYLN","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:0830bce7554785adbf413927a849ff898c4bb99d7ae6c4b42b88d4faf1a146cb","target":"graph","created_at":"2026-05-17T23:58:47Z","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 develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world networks) while still guaranteeing approximation ratios. The idea is to $\\textit{edit}$ a given graph via vertex- or edge-deletions to put the graph into an algorithmically tractable class, apply known approximation algorithms for that class, and then $\\textit{lift}$ the solution to apply to the original graph. We give a general characterization of when an optimi","authors_text":"Ali Vakilian, Andrew van der Poel, Blair D. Sullivan, Brian Lavallee, Erik D. Demaine, Kyle Kloster, Quanquan C. Liu, Timothy D. Goodrich","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-07T16:39:17Z","title":"Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02771","kind":"arxiv","version":3},"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:d3102f12760a5460a8ac12a7dfa00c16bd3446f04c73c953c9fd6dd5154fbe12","target":"record","created_at":"2026-05-17T23:58:47Z","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":"499eaac92d022561b09021172b293b7961b7726479dff7e2971c7dc9aa9f7b9b","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-07T16:39:17Z","title_canon_sha256":"b8f63ae032d58580d95420ff96f82f5fe1923351359846fe28a7080f5c3d0fc7"},"schema_version":"1.0","source":{"id":"1806.02771","kind":"arxiv","version":3}},"canonical_sha256":"cce7e8616df9d4aebb6a9d2995a8f116b0ba69d07b4ce1a929d73cb789015668","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cce7e8616df9d4aebb6a9d2995a8f116b0ba69d07b4ce1a929d73cb789015668","first_computed_at":"2026-05-17T23:58:47.933765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:47.933765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"760fhq1jUk9qICj+VsFx0M94CNnDQKlBMC50B4DV6bPVWVW8Mp7xoSlzJUE/WfSMENH0qE5By+6tQDixMIdvBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:47.934169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02771","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3102f12760a5460a8ac12a7dfa00c16bd3446f04c73c953c9fd6dd5154fbe12","sha256:0830bce7554785adbf413927a849ff898c4bb99d7ae6c4b42b88d4faf1a146cb"],"state_sha256":"04ecbfa969c2d306151c1d5195acd419efe23de8d73f85c1bbd025a30ea56698"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSQOogBVNY7wRkmZlojWvSuSjW+WDwWJYib3nK/exc/rhPV/4jQzoraRRVmgZTvmm3HZZEqEWp0DljZ3hqOADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:05:25.681835Z","bundle_sha256":"1c6202838da98042e2158dafac7dd76ba1e9512024027690d2c86e04e0d712d6"}}