{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WDNISWQNMFECWD7EJCF7WDUZP6","short_pith_number":"pith:WDNISWQN","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"},"canonical_sha256":"b0da895a0d61482b0fe4488bfb0e997fa22711ec03f48dd1beb496cfec0a79e3","source":{"kind":"arxiv","id":"1304.1982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1982","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1982v1","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1982","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"WDNISWQNMFEC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WDNISWQNMFECWD7E","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WDNISWQN","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WDNISWQNMFECWD7EJCF7WDUZP6","target":"record","payload":{"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"},"canonical_sha256":"b0da895a0d61482b0fe4488bfb0e997fa22711ec03f48dd1beb496cfec0a79e3","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"},"source_kind":"arxiv","source_id":"1304.1982","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-18T03:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxxOjw2bbUIV9Rwb6X6WdZsvCMoGVOeFOF+PaD/W3zdEd5XY2C/a2DKszi9TfNXG1IigIbxpBK1GlYv5pPxlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:57:27.228988Z"},"content_sha256":"93cec004be9cc6ded642714dca2779180173ff034c67364e04b38c558bc6e491","schema_version":"1.0","event_id":"sha256:93cec004be9cc6ded642714dca2779180173ff034c67364e04b38c558bc6e491"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WDNISWQNMFECWD7EJCF7WDUZP6","target":"graph","payload":{"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"},"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-18T03:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Cu6G5LJJQWg2CfXj6+S4QUDeB/QXKWYH8M7L3GXxeN7TukHKbNnScAlNDXRF62xlz3d95zhiKZdUgWMMQiaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:57:27.229346Z"},"content_sha256":"5a1a69d5d9acff49a3cc1c03ddd76a48fd6af83c50d92c9208876183fd4a615b","schema_version":"1.0","event_id":"sha256:5a1a69d5d9acff49a3cc1c03ddd76a48fd6af83c50d92c9208876183fd4a615b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/bundle.json","state_url":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDNISWQNMFECWD7EJCF7WDUZP6/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-03T20:57:27Z","links":{"resolver":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6","bundle":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/bundle.json","state":"https://pith.science/pith/WDNISWQNMFECWD7EJCF7WDUZP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDNISWQNMFECWD7EJCF7WDUZP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WDNISWQNMFECWD7EJCF7WDUZP6","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":"7f28ca32848830870c84262152b79baf9754788d258f0fef957b797633459492","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-07T11:14:03Z","title_canon_sha256":"91e04abc38b5766af5c00703d56fd7592ad5ce72386deab4abec99726e815e51"},"schema_version":"1.0","source":{"id":"1304.1982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1982","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1982v1","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1982","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"WDNISWQNMFEC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WDNISWQNMFECWD7E","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WDNISWQN","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:5a1a69d5d9acff49a3cc1c03ddd76a48fd6af83c50d92c9208876183fd4a615b","target":"graph","created_at":"2026-05-18T03:28:44Z","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":"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,","authors_text":"Asaf Shapira, Lior Gishboliner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-07T11:14:03Z","title":"Deterministic vs Non-deterministic Graph Property Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1982","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:93cec004be9cc6ded642714dca2779180173ff034c67364e04b38c558bc6e491","target":"record","created_at":"2026-05-18T03:28:44Z","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":"7f28ca32848830870c84262152b79baf9754788d258f0fef957b797633459492","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-07T11:14:03Z","title_canon_sha256":"91e04abc38b5766af5c00703d56fd7592ad5ce72386deab4abec99726e815e51"},"schema_version":"1.0","source":{"id":"1304.1982","kind":"arxiv","version":1}},"canonical_sha256":"b0da895a0d61482b0fe4488bfb0e997fa22711ec03f48dd1beb496cfec0a79e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0da895a0d61482b0fe4488bfb0e997fa22711ec03f48dd1beb496cfec0a79e3","first_computed_at":"2026-05-18T03:28:44.546618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:44.546618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G1sVUepRS9+332rtUr5CpiXVVowGyFhXejjXcepRkWjG9lzV1koxzG+PFn8m1F8KMl3AfbPSUk5yLboT9YLuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:44.547365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93cec004be9cc6ded642714dca2779180173ff034c67364e04b38c558bc6e491","sha256:5a1a69d5d9acff49a3cc1c03ddd76a48fd6af83c50d92c9208876183fd4a615b"],"state_sha256":"9056dac612bb97f6eb98897b9580d319e8abcdf95cc7d6a715a4cf907a958ba1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"La2kK90hqy3bnclEeze0GkoYnxmDq2eNa+DlvT76WNfNXzkgKivlP7rjvthlb2VtzdJLQVIeH+kSdvDY9BVXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:57:27.231218Z","bundle_sha256":"0f326ad231d7dcb3b48abed2faa42f96153b810efd5e34bf4a3d3bfbcd7e2c28"}}