{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WDNISWQNMFECWD7EJCF7WDUZP6","short_pith_number":"pith:WDNISWQN","schema_version":"1.0","canonical_sha256":"b0da895a0d61482b0fe4488bfb0e997fa22711ec03f48dd1beb496cfec0a79e3","source":{"kind":"arxiv","id":"1304.1982","version":1},"attestation_state":"computed","paper":{"title":"Deterministic vs Non-deterministic Graph Property Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Lior Gishboliner","submitted_at":"2013-04-07T11:14:03Z","abstract_excerpt":"A graph property P is said to be testable if one can check if a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-deterministically testable if one can supply a \"certificate\" to the fact that a graph satisfies P so that once the certificate is given its correctness can be tested. The notion of non-deterministic testing of graph properties was recently introduced by Lovasz and Vesztergombi, who proved that (somewhat surprisingly) a graph property is testable if and only if it is non-deterministically testable. Their proof used graph limits,"},"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":"1304.1982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-07T11:14:03Z","cross_cats_sorted":[],"title_canon_sha256":"91e04abc38b5766af5c00703d56fd7592ad5ce72386deab4abec99726e815e51","abstract_canon_sha256":"7f28ca32848830870c84262152b79baf9754788d258f0fef957b797633459492"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:44.547365Z","signature_b64":"G1sVUepRS9+332rtUr5CpiXVVowGyFhXejjXcepRkWjG9lzV1koxzG+PFn8m1F8KMl3AfbPSUk5yLboT9YLuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0da895a0d61482b0fe4488bfb0e997fa22711ec03f48dd1beb496cfec0a79e3","last_reissued_at":"2026-05-18T03:28:44.546618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:44.546618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic vs Non-deterministic Graph Property Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Lior Gishboliner","submitted_at":"2013-04-07T11:14:03Z","abstract_excerpt":"A graph property P is said to be testable if one can check if a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-deterministically testable if one can supply a \"certificate\" to the fact that a graph satisfies P so that once the certificate is given its correctness can be tested. The notion of non-deterministic testing of graph properties was recently introduced by Lovasz and Vesztergombi, who proved that (somewhat surprisingly) a graph property is testable if and only if it is non-deterministically testable. Their proof used graph limits,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1982","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":"1304.1982","created_at":"2026-05-18T03:28:44.546750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1982v1","created_at":"2026-05-18T03:28:44.546750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1982","created_at":"2026-05-18T03:28:44.546750+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDNISWQNMFEC","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDNISWQNMFECWD7E","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDNISWQN","created_at":"2026-05-18T12:28:04.890932+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/WDNISWQNMFECWD7EJCF7WDUZP6","json":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6.json","graph_json":"https://pith.science/api/pith-number/WDNISWQNMFECWD7EJCF7WDUZP6/graph.json","events_json":"https://pith.science/api/pith-number/WDNISWQNMFECWD7EJCF7WDUZP6/events.json","paper":"https://pith.science/paper/WDNISWQN"},"agent_actions":{"view_html":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6","download_json":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6.json","view_paper":"https://pith.science/paper/WDNISWQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1982&json=true","fetch_graph":"https://pith.science/api/pith-number/WDNISWQNMFECWD7EJCF7WDUZP6/graph.json","fetch_events":"https://pith.science/api/pith-number/WDNISWQNMFECWD7EJCF7WDUZP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/action/storage_attestation","attest_author":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/action/author_attestation","sign_citation":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/action/citation_signature","submit_replication":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/action/replication_record"}},"created_at":"2026-05-18T03:28:44.546750+00:00","updated_at":"2026-05-18T03:28:44.546750+00:00"}