{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BIU5ISHRPDZST4OUEXHFEG5ENV","short_pith_number":"pith:BIU5ISHR","canonical_record":{"source":{"id":"1503.07093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T16:06:23Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"f9451bcad7809eadf6c25d796b5cbbbf1857fd2d5777230f8c5d33a220af0698","abstract_canon_sha256":"95b0d35c5329fd36a190dd7ac53186237264e519edf293c1cb730d75d202e686"},"schema_version":"1.0"},"canonical_sha256":"0a29d448f178f329f1d425ce521ba46d451ad1f5754a6733ea37328cea1c214d","source":{"kind":"arxiv","id":"1503.07093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07093","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07093v1","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07093","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"BIU5ISHRPDZS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BIU5ISHRPDZST4OU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BIU5ISHR","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BIU5ISHRPDZST4OUEXHFEG5ENV","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T16:06:23Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"f9451bcad7809eadf6c25d796b5cbbbf1857fd2d5777230f8c5d33a220af0698","abstract_canon_sha256":"95b0d35c5329fd36a190dd7ac53186237264e519edf293c1cb730d75d202e686"},"schema_version":"1.0"},"canonical_sha256":"0a29d448f178f329f1d425ce521ba46d451ad1f5754a6733ea37328cea1c214d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:29.412490Z","signature_b64":"UZPiBKFXnmCamsn99+Bamb4sTlkh8daFdm8Qr+hJqKiOhK2xBRgNbcgPe1f6B0YXFkiT8v04LuP1ziN88q8CAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a29d448f178f329f1d425ce521ba46d451ad1f5754a6733ea37328cea1c214d","last_reissued_at":"2026-05-18T02:20:29.411966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:29.411966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07093","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-18T02:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjkRalJwaKb5t5rpnkqcq5QUY/e9yhXfIPbgitK/CDB5Cr3mE3IBuwFg9kQ04VqMcLeR+P5iOI2LzlwvFr9zAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:51:41.095676Z"},"content_sha256":"8ed1c396d1fb94ed3b8f732eff2695da0682e16a93914dc33c3ef55eadba1514","schema_version":"1.0","event_id":"sha256:8ed1c396d1fb94ed3b8f732eff2695da0682e16a93914dc33c3ef55eadba1514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BIU5ISHRPDZST4OUEXHFEG5ENV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Nondeterministically Testable Hypergraph Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Marek Karpinski, Roland Mark\\'o","submitted_at":"2015-03-24T16:06:23Z","abstract_excerpt":"The paper proves the equivalence of the notions of nondeterministic and deterministic parameter testing for uniform dense hypergraphs of arbitrary order. It generalizes the result previously known only for the case of simple graphs. By a similar method we establish also the equivalence between nondeterministic and deterministic hypergraph property testing, answering the open problem in the area. We introduce a new notion of a cut norm for hypergraphs of higher order, and employ regularity techniques combined with the ultralimit method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07093","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-18T02:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKEjVnRqKX7f4VqLnkcEaO6JXUF96Pk8G8SRLRA7neO80bh7GG7f0l6Y2VONWphpVi4bL5jFTankxCy+4+nECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:51:41.096294Z"},"content_sha256":"864c59ad06dcaf4c7855d02b015290ed4d6df6b17063413f3848813b68c62619","schema_version":"1.0","event_id":"sha256:864c59ad06dcaf4c7855d02b015290ed4d6df6b17063413f3848813b68c62619"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BIU5ISHRPDZST4OUEXHFEG5ENV/bundle.json","state_url":"https://pith.science/pith/BIU5ISHRPDZST4OUEXHFEG5ENV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BIU5ISHRPDZST4OUEXHFEG5ENV/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-28T16:51:41Z","links":{"resolver":"https://pith.science/pith/BIU5ISHRPDZST4OUEXHFEG5ENV","bundle":"https://pith.science/pith/BIU5ISHRPDZST4OUEXHFEG5ENV/bundle.json","state":"https://pith.science/pith/BIU5ISHRPDZST4OUEXHFEG5ENV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BIU5ISHRPDZST4OUEXHFEG5ENV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BIU5ISHRPDZST4OUEXHFEG5ENV","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":"95b0d35c5329fd36a190dd7ac53186237264e519edf293c1cb730d75d202e686","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T16:06:23Z","title_canon_sha256":"f9451bcad7809eadf6c25d796b5cbbbf1857fd2d5777230f8c5d33a220af0698"},"schema_version":"1.0","source":{"id":"1503.07093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07093","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07093v1","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07093","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"BIU5ISHRPDZS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BIU5ISHRPDZST4OU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BIU5ISHR","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:864c59ad06dcaf4c7855d02b015290ed4d6df6b17063413f3848813b68c62619","target":"graph","created_at":"2026-05-18T02:20:29Z","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":"The paper proves the equivalence of the notions of nondeterministic and deterministic parameter testing for uniform dense hypergraphs of arbitrary order. It generalizes the result previously known only for the case of simple graphs. By a similar method we establish also the equivalence between nondeterministic and deterministic hypergraph property testing, answering the open problem in the area. We introduce a new notion of a cut norm for hypergraphs of higher order, and employ regularity techniques combined with the ultralimit method.","authors_text":"Marek Karpinski, Roland Mark\\'o","cross_cats":["math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T16:06:23Z","title":"On the Complexity of Nondeterministically Testable Hypergraph Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07093","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:8ed1c396d1fb94ed3b8f732eff2695da0682e16a93914dc33c3ef55eadba1514","target":"record","created_at":"2026-05-18T02:20:29Z","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":"95b0d35c5329fd36a190dd7ac53186237264e519edf293c1cb730d75d202e686","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T16:06:23Z","title_canon_sha256":"f9451bcad7809eadf6c25d796b5cbbbf1857fd2d5777230f8c5d33a220af0698"},"schema_version":"1.0","source":{"id":"1503.07093","kind":"arxiv","version":1}},"canonical_sha256":"0a29d448f178f329f1d425ce521ba46d451ad1f5754a6733ea37328cea1c214d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a29d448f178f329f1d425ce521ba46d451ad1f5754a6733ea37328cea1c214d","first_computed_at":"2026-05-18T02:20:29.411966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:29.411966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UZPiBKFXnmCamsn99+Bamb4sTlkh8daFdm8Qr+hJqKiOhK2xBRgNbcgPe1f6B0YXFkiT8v04LuP1ziN88q8CAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:29.412490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ed1c396d1fb94ed3b8f732eff2695da0682e16a93914dc33c3ef55eadba1514","sha256:864c59ad06dcaf4c7855d02b015290ed4d6df6b17063413f3848813b68c62619"],"state_sha256":"e03a82569a3ac359a8ffb1e852d2d2422e46eb4d484c40dd6cc4ebaee0948d66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDDXUoWt3if+5oOCD/sEAP4aX6j+zf+CDavqotBSSUbu+TjHiIGMV6taVtOj/FrQWErz6Sfd27jYnN+P7NZ+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:51:41.099855Z","bundle_sha256":"ece0859e06a23694cd5be4d97df84ee431c4f81415612a40567a28a0744d3e42"}}