{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KGMJVEZOZ7BOSNVVHX6UEJSHXS","short_pith_number":"pith:KGMJVEZO","canonical_record":{"source":{"id":"1709.09985","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-28T14:30:38Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"b95c1dd5ad7d8e7137d244fce9e3e1cb54526eb19dc997cd1943fb984fbc5bcf","abstract_canon_sha256":"37f3ec624bd2f3d734117f928daa30c2477831f60bbeea7f017ff8f839f752c5"},"schema_version":"1.0"},"canonical_sha256":"51989a932ecfc2e936b53dfd422647bcaeefc4316353e8150922a23c54d961c1","source":{"kind":"arxiv","id":"1709.09985","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09985","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09985v3","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09985","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"KGMJVEZOZ7BO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KGMJVEZOZ7BOSNVV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KGMJVEZO","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KGMJVEZOZ7BOSNVVHX6UEJSHXS","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09985","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-28T14:30:38Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"b95c1dd5ad7d8e7137d244fce9e3e1cb54526eb19dc997cd1943fb984fbc5bcf","abstract_canon_sha256":"37f3ec624bd2f3d734117f928daa30c2477831f60bbeea7f017ff8f839f752c5"},"schema_version":"1.0"},"canonical_sha256":"51989a932ecfc2e936b53dfd422647bcaeefc4316353e8150922a23c54d961c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:14.169173Z","signature_b64":"qDqSnRBcRHA/sNE3W3RTVqvW7BmOv4DvbwwmAxixZpLy4BiUbIC+4aT4S0UVrvt8HAJlo45pMXqzggmgV8N0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51989a932ecfc2e936b53dfd422647bcaeefc4316353e8150922a23c54d961c1","last_reissued_at":"2026-05-18T00:12:14.168081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:14.168081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09985","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-18T00:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1kE4UH/IY0hP/UgQ16JYcuOQ+zTHX17s907WCX4TNbJj3yil/D4d/4Rs9UhgqKKYQE7U7YkSWBiv2QTtF0x6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:12:54.910775Z"},"content_sha256":"5047cc0d0430b6a83232316e75e1dca2b3927339ab59688d79322e4d313ef638","schema_version":"1.0","event_id":"sha256:5047cc0d0430b6a83232316e75e1dca2b3927339ab59688d79322e4d313ef638"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KGMJVEZOZ7BOSNVVHX6UEJSHXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recovering sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"cs.DM","authors_text":"Daniel Kral, Jakub Gajarsky","submitted_at":"2017-09-28T14:30:38Z","abstract_excerpt":"We construct a fixed parameter algorithm parameterized by d and k that takes as an input a graph G' obtained from a d-degenerate graph G by complementing on at most k arbitrary subsets of the vertex set of G and outputs a graph H such that G and H agree on all but f(d,k) vertices.\n  Our work is motivated by the first order model checking in graph classes that are first order interpretable in classes of sparse graphs. We derive as a corollary that if G_0 is a graph class with bounded expansion, then the first order model checking is fixed parameter tractable in the class of all graphs that can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09985","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-18T00:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzigA/OE8G5HYdpZvQH+ZROAzV8htyIkOwqFA/KJPuCqXGV/LM92TocETyVW7bOZ8OSiLYgaIWy2fgbec7aqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:12:54.911132Z"},"content_sha256":"6327cdb0ddbd9970b47be9dd314a6af2a366103aa53382bbfaba38fc07923a6b","schema_version":"1.0","event_id":"sha256:6327cdb0ddbd9970b47be9dd314a6af2a366103aa53382bbfaba38fc07923a6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGMJVEZOZ7BOSNVVHX6UEJSHXS/bundle.json","state_url":"https://pith.science/pith/KGMJVEZOZ7BOSNVVHX6UEJSHXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGMJVEZOZ7BOSNVVHX6UEJSHXS/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-04T05:12:54Z","links":{"resolver":"https://pith.science/pith/KGMJVEZOZ7BOSNVVHX6UEJSHXS","bundle":"https://pith.science/pith/KGMJVEZOZ7BOSNVVHX6UEJSHXS/bundle.json","state":"https://pith.science/pith/KGMJVEZOZ7BOSNVVHX6UEJSHXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGMJVEZOZ7BOSNVVHX6UEJSHXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KGMJVEZOZ7BOSNVVHX6UEJSHXS","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":"37f3ec624bd2f3d734117f928daa30c2477831f60bbeea7f017ff8f839f752c5","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-28T14:30:38Z","title_canon_sha256":"b95c1dd5ad7d8e7137d244fce9e3e1cb54526eb19dc997cd1943fb984fbc5bcf"},"schema_version":"1.0","source":{"id":"1709.09985","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09985","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09985v3","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09985","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"KGMJVEZOZ7BO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KGMJVEZOZ7BOSNVV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KGMJVEZO","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6327cdb0ddbd9970b47be9dd314a6af2a366103aa53382bbfaba38fc07923a6b","target":"graph","created_at":"2026-05-18T00:12:14Z","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 construct a fixed parameter algorithm parameterized by d and k that takes as an input a graph G' obtained from a d-degenerate graph G by complementing on at most k arbitrary subsets of the vertex set of G and outputs a graph H such that G and H agree on all but f(d,k) vertices.\n  Our work is motivated by the first order model checking in graph classes that are first order interpretable in classes of sparse graphs. We derive as a corollary that if G_0 is a graph class with bounded expansion, then the first order model checking is fixed parameter tractable in the class of all graphs that can ","authors_text":"Daniel Kral, Jakub Gajarsky","cross_cats":["cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-28T14:30:38Z","title":"Recovering sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09985","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:5047cc0d0430b6a83232316e75e1dca2b3927339ab59688d79322e4d313ef638","target":"record","created_at":"2026-05-18T00:12:14Z","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":"37f3ec624bd2f3d734117f928daa30c2477831f60bbeea7f017ff8f839f752c5","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-28T14:30:38Z","title_canon_sha256":"b95c1dd5ad7d8e7137d244fce9e3e1cb54526eb19dc997cd1943fb984fbc5bcf"},"schema_version":"1.0","source":{"id":"1709.09985","kind":"arxiv","version":3}},"canonical_sha256":"51989a932ecfc2e936b53dfd422647bcaeefc4316353e8150922a23c54d961c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51989a932ecfc2e936b53dfd422647bcaeefc4316353e8150922a23c54d961c1","first_computed_at":"2026-05-18T00:12:14.168081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:14.168081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qDqSnRBcRHA/sNE3W3RTVqvW7BmOv4DvbwwmAxixZpLy4BiUbIC+4aT4S0UVrvt8HAJlo45pMXqzggmgV8N0CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:14.169173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09985","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5047cc0d0430b6a83232316e75e1dca2b3927339ab59688d79322e4d313ef638","sha256:6327cdb0ddbd9970b47be9dd314a6af2a366103aa53382bbfaba38fc07923a6b"],"state_sha256":"ac25fe40da58e2256bf7c3ec392d8a467e2a602e1ebcff037372bd32c85bb05e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTPk5+tw3mieFzEFCWPJPdQXjprE8WeW4PPl6r1QcDdfqtaOI+ZzzNTLlmq5zxgfpZ+dhTLYnbLPHuD9bNjWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:12:54.913141Z","bundle_sha256":"8ded5f091425d642c7f1658841a6e364e527016bd12bb6bae04ff3a38858d93e"}}