{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XIV2F64LJMEO7VBRUV2SIWDOLW","short_pith_number":"pith:XIV2F64L","canonical_record":{"source":{"id":"1303.5601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T12:48:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"593b6865d70544de9221280b57fec85f1d7bfbc137e1d2b6fa6340397939743d","abstract_canon_sha256":"b6c03795aee86e83949d4d4ad9ce807f9d0c077282f4fc847b0dc237f38a1e8c"},"schema_version":"1.0"},"canonical_sha256":"ba2ba2fb8b4b08efd431a57524586e5db8de13517490803b795dc35801ae781f","source":{"kind":"arxiv","id":"1303.5601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5601","created_at":"2026-05-18T03:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5601v1","created_at":"2026-05-18T03:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5601","created_at":"2026-05-18T03:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"XIV2F64LJMEO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XIV2F64LJMEO7VBR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XIV2F64L","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XIV2F64LJMEO7VBRUV2SIWDOLW","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T12:48:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"593b6865d70544de9221280b57fec85f1d7bfbc137e1d2b6fa6340397939743d","abstract_canon_sha256":"b6c03795aee86e83949d4d4ad9ce807f9d0c077282f4fc847b0dc237f38a1e8c"},"schema_version":"1.0"},"canonical_sha256":"ba2ba2fb8b4b08efd431a57524586e5db8de13517490803b795dc35801ae781f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:03.719144Z","signature_b64":"eRDFQm0f2s/NpEIcgfkLXD9oSKIUM1l85F4JTEx4LR2MGi0jSH0thqGyntxfAi8zs4mEcdvQxVmgU9nyGiNUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba2ba2fb8b4b08efd431a57524586e5db8de13517490803b795dc35801ae781f","last_reissued_at":"2026-05-18T03:30:03.718523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:03.718523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5601","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:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68KjW7KW25ZyUMJSPbNmE9P75OONQAhH8fQKO/XOIasyUPNV3ELqTLWlAi5jaSksK6WLyfm0BQ+S+5oS2sLKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:51:37.161223Z"},"content_sha256":"24aadbab7544bedd8f95ddcfd82f0a1ab8b1a1f6846162a3fa0874e8ef508296","schema_version":"1.0","event_id":"sha256:24aadbab7544bedd8f95ddcfd82f0a1ab8b1a1f6846162a3fa0874e8ef508296"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XIV2F64LJMEO7VBRUV2SIWDOLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The smallest nonevasive graph property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Michal Adamaszek","submitted_at":"2013-03-22T12:48:47Z","abstract_excerpt":"A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form \"is there an edge between vertices u and v\" requires, in the worst case, to ask about all pairs of vertices. Most \"natural\" graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n=6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs and show that it is essentially the unique such with n at most 5."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5601","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:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/VcBDo7UbOOnyJLWJDv6k7DQkuDWScfqkxSpOaQkiMdIpkVKrFpLn61yLlO04Ojk/5oII0fJgVslvPDg8eEpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:51:37.161591Z"},"content_sha256":"6f2a32a78f691eb4994b470546664da5238df2192a310d629189be43dc561c94","schema_version":"1.0","event_id":"sha256:6f2a32a78f691eb4994b470546664da5238df2192a310d629189be43dc561c94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIV2F64LJMEO7VBRUV2SIWDOLW/bundle.json","state_url":"https://pith.science/pith/XIV2F64LJMEO7VBRUV2SIWDOLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIV2F64LJMEO7VBRUV2SIWDOLW/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-28T11:51:37Z","links":{"resolver":"https://pith.science/pith/XIV2F64LJMEO7VBRUV2SIWDOLW","bundle":"https://pith.science/pith/XIV2F64LJMEO7VBRUV2SIWDOLW/bundle.json","state":"https://pith.science/pith/XIV2F64LJMEO7VBRUV2SIWDOLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIV2F64LJMEO7VBRUV2SIWDOLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XIV2F64LJMEO7VBRUV2SIWDOLW","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":"b6c03795aee86e83949d4d4ad9ce807f9d0c077282f4fc847b0dc237f38a1e8c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T12:48:47Z","title_canon_sha256":"593b6865d70544de9221280b57fec85f1d7bfbc137e1d2b6fa6340397939743d"},"schema_version":"1.0","source":{"id":"1303.5601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5601","created_at":"2026-05-18T03:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5601v1","created_at":"2026-05-18T03:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5601","created_at":"2026-05-18T03:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"XIV2F64LJMEO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XIV2F64LJMEO7VBR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XIV2F64L","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:6f2a32a78f691eb4994b470546664da5238df2192a310d629189be43dc561c94","target":"graph","created_at":"2026-05-18T03:30:03Z","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 property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form \"is there an edge between vertices u and v\" requires, in the worst case, to ask about all pairs of vertices. Most \"natural\" graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n=6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs and show that it is essentially the unique such with n at most 5.","authors_text":"Michal Adamaszek","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T12:48:47Z","title":"The smallest nonevasive graph property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5601","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:24aadbab7544bedd8f95ddcfd82f0a1ab8b1a1f6846162a3fa0874e8ef508296","target":"record","created_at":"2026-05-18T03:30:03Z","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":"b6c03795aee86e83949d4d4ad9ce807f9d0c077282f4fc847b0dc237f38a1e8c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T12:48:47Z","title_canon_sha256":"593b6865d70544de9221280b57fec85f1d7bfbc137e1d2b6fa6340397939743d"},"schema_version":"1.0","source":{"id":"1303.5601","kind":"arxiv","version":1}},"canonical_sha256":"ba2ba2fb8b4b08efd431a57524586e5db8de13517490803b795dc35801ae781f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba2ba2fb8b4b08efd431a57524586e5db8de13517490803b795dc35801ae781f","first_computed_at":"2026-05-18T03:30:03.718523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:03.718523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eRDFQm0f2s/NpEIcgfkLXD9oSKIUM1l85F4JTEx4LR2MGi0jSH0thqGyntxfAi8zs4mEcdvQxVmgU9nyGiNUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:03.719144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24aadbab7544bedd8f95ddcfd82f0a1ab8b1a1f6846162a3fa0874e8ef508296","sha256:6f2a32a78f691eb4994b470546664da5238df2192a310d629189be43dc561c94"],"state_sha256":"7bb2cb39918ef744064c62fcdd0a3939451e6055d8ba49055707306d8527bb19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kjJWGd53dRhEOa8a0fYeIq1zQkxbNtZ93EEk4PsrOnK8SKhnZe+WO1tjMg4UAcWD6UjoNQAkpgdm8JP2Y9zDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:51:37.163570Z","bundle_sha256":"9a7199a7d5edaf764eda66116397e8545f33eb7fb0473660c80b031d3e992982"}}