{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KPJHXF2SQRYU7GY6F27CHC5RMF","short_pith_number":"pith:KPJHXF2S","canonical_record":{"source":{"id":"1811.02937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T15:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"893485b2624edc030a82bc0adbbfbddee1754e9a2adcb15d8a0ad25cd5c1b92f","abstract_canon_sha256":"87b20ccb29ac9770ebcf59002afd309b38e5ff71f9c6f1533afc709205f7c74d"},"schema_version":"1.0"},"canonical_sha256":"53d27b975284714f9b1e2ebe238bb1617344e970ebc3e5f80503c453fa42b950","source":{"kind":"arxiv","id":"1811.02937","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02937","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02937v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02937","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"KPJHXF2SQRYU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KPJHXF2SQRYU7GY6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KPJHXF2S","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KPJHXF2SQRYU7GY6F27CHC5RMF","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T15:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"893485b2624edc030a82bc0adbbfbddee1754e9a2adcb15d8a0ad25cd5c1b92f","abstract_canon_sha256":"87b20ccb29ac9770ebcf59002afd309b38e5ff71f9c6f1533afc709205f7c74d"},"schema_version":"1.0"},"canonical_sha256":"53d27b975284714f9b1e2ebe238bb1617344e970ebc3e5f80503c453fa42b950","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.348755Z","signature_b64":"uJwlyMHpwXoV3eAvm9z6jgH6rFMSZ0hr9HNKC7HNEJurkAzHz8+O7cG9ei6Agjv55f/0f+pl+29LWJ9D8JgeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53d27b975284714f9b1e2ebe238bb1617344e970ebc3e5f80503c453fa42b950","last_reissued_at":"2026-05-18T00:01:20.348333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.348333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02937","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-05-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zq9zpgmwEvHsI6yyb0DtHhiWyVIJLzJ/gymLmSadkVta2m+3PjvtSVrT+LJgsm86BxlXZRK3DNsU0jIrQ3i8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:08:12.796105Z"},"content_sha256":"3491c122e3e959b44ae2a675185a22169d3cfbec1c1d95230e0620730b0e65ba","schema_version":"1.0","event_id":"sha256:3491c122e3e959b44ae2a675185a22169d3cfbec1c1d95230e0620730b0e65ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KPJHXF2SQRYU7GY6F27CHC5RMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Hendrik Fichtenberger, Pan Peng","submitted_at":"2018-11-07T15:34:41Z","abstract_excerpt":"One of the most fundamental questions in graph property testing is to characterize the combinatorial structure of properties that are testable with a constant number of queries. We work towards an answer to this question for the bounded-degree graph model introduced in [Goldreich, Ron, 2002], where the input graphs have maximum degree bounded by a constant $d$. In this model, it is known (among other results) that every \\emph{hyperfinite} property is constant-query testable [Newman, Sohler, 2013], where, informally, a graph property is hyperfinite, if for every $\\delta >0$ every graph in the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02937","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":""},"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:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3iQNWUqt30OGD4DVO5OgRa8SBpJ39kXs/mlRwA73YtzcQkabpvUHMW8xSBjPJ4i+EseqQZTBxZw8Tl0G+gRgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:08:12.796760Z"},"content_sha256":"ee27dcd60036319916f938eb6c9341c582d70fe285bd5107e0ecc03ca1447bb5","schema_version":"1.0","event_id":"sha256:ee27dcd60036319916f938eb6c9341c582d70fe285bd5107e0ecc03ca1447bb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/bundle.json","state_url":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/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-05-26T18:08:12Z","links":{"resolver":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF","bundle":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/bundle.json","state":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KPJHXF2SQRYU7GY6F27CHC5RMF","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":"87b20ccb29ac9770ebcf59002afd309b38e5ff71f9c6f1533afc709205f7c74d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T15:34:41Z","title_canon_sha256":"893485b2624edc030a82bc0adbbfbddee1754e9a2adcb15d8a0ad25cd5c1b92f"},"schema_version":"1.0","source":{"id":"1811.02937","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02937","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02937v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02937","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"KPJHXF2SQRYU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KPJHXF2SQRYU7GY6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KPJHXF2S","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:ee27dcd60036319916f938eb6c9341c582d70fe285bd5107e0ecc03ca1447bb5","target":"graph","created_at":"2026-05-18T00:01:20Z","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":"One of the most fundamental questions in graph property testing is to characterize the combinatorial structure of properties that are testable with a constant number of queries. We work towards an answer to this question for the bounded-degree graph model introduced in [Goldreich, Ron, 2002], where the input graphs have maximum degree bounded by a constant $d$. In this model, it is known (among other results) that every \\emph{hyperfinite} property is constant-query testable [Newman, Sohler, 2013], where, informally, a graph property is hyperfinite, if for every $\\delta >0$ every graph in the p","authors_text":"Christian Sohler, Hendrik Fichtenberger, Pan Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T15:34:41Z","title":"Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02937","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:3491c122e3e959b44ae2a675185a22169d3cfbec1c1d95230e0620730b0e65ba","target":"record","created_at":"2026-05-18T00:01:20Z","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":"87b20ccb29ac9770ebcf59002afd309b38e5ff71f9c6f1533afc709205f7c74d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T15:34:41Z","title_canon_sha256":"893485b2624edc030a82bc0adbbfbddee1754e9a2adcb15d8a0ad25cd5c1b92f"},"schema_version":"1.0","source":{"id":"1811.02937","kind":"arxiv","version":1}},"canonical_sha256":"53d27b975284714f9b1e2ebe238bb1617344e970ebc3e5f80503c453fa42b950","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53d27b975284714f9b1e2ebe238bb1617344e970ebc3e5f80503c453fa42b950","first_computed_at":"2026-05-18T00:01:20.348333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.348333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uJwlyMHpwXoV3eAvm9z6jgH6rFMSZ0hr9HNKC7HNEJurkAzHz8+O7cG9ei6Agjv55f/0f+pl+29LWJ9D8JgeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.348755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02937","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3491c122e3e959b44ae2a675185a22169d3cfbec1c1d95230e0620730b0e65ba","sha256:ee27dcd60036319916f938eb6c9341c582d70fe285bd5107e0ecc03ca1447bb5"],"state_sha256":"cf04410420e0e07e6e20dd5704db0bcd7b4230b4e84919152bd8e9579eb02813"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oO8idcKJrSzLhVwCT109AF9aqOVYU1yAoqJuGg0bGj0PL6YJTVuBv7nD/Rchb0VEu0194JGFRYiiOgpFybOjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:08:12.800153Z","bundle_sha256":"61c76cca0aaf499a42a4360f4380a9446f2c5e16826f084849e188468b65b6ee"}}