{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KPJHXF2SQRYU7GY6F27CHC5RMF","short_pith_number":"pith:KPJHXF2S","schema_version":"1.0","canonical_sha256":"53d27b975284714f9b1e2ebe238bb1617344e970ebc3e5f80503c453fa42b950","source":{"kind":"arxiv","id":"1811.02937","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.02937","created_at":"2026-05-18T00:01:20.348399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02937v1","created_at":"2026-05-18T00:01:20.348399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02937","created_at":"2026-05-18T00:01:20.348399+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPJHXF2SQRYU","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPJHXF2SQRYU7GY6","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPJHXF2S","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF","json":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF.json","graph_json":"https://pith.science/api/pith-number/KPJHXF2SQRYU7GY6F27CHC5RMF/graph.json","events_json":"https://pith.science/api/pith-number/KPJHXF2SQRYU7GY6F27CHC5RMF/events.json","paper":"https://pith.science/paper/KPJHXF2S"},"agent_actions":{"view_html":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF","download_json":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF.json","view_paper":"https://pith.science/paper/KPJHXF2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02937&json=true","fetch_graph":"https://pith.science/api/pith-number/KPJHXF2SQRYU7GY6F27CHC5RMF/graph.json","fetch_events":"https://pith.science/api/pith-number/KPJHXF2SQRYU7GY6F27CHC5RMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/action/storage_attestation","attest_author":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/action/author_attestation","sign_citation":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/action/citation_signature","submit_replication":"https://pith.science/pith/KPJHXF2SQRYU7GY6F27CHC5RMF/action/replication_record"}},"created_at":"2026-05-18T00:01:20.348399+00:00","updated_at":"2026-05-18T00:01:20.348399+00:00"}