{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NNKIHIOIYTLP2M7PQPG7U6MPRV","short_pith_number":"pith:NNKIHIOI","canonical_record":{"source":{"id":"1406.3514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-13T12:01:30Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"8ae727cceb596d8879dcffc79c43cbe31af2d046ba7efe43588a58f9983124e6","abstract_canon_sha256":"b4aca27eb9ae2d8e513ea11ae3decc6ccf8eeba61aae9efe4307786edb652f59"},"schema_version":"1.0"},"canonical_sha256":"6b5483a1c8c4d6fd33ef83cdfa798f8d76678677454343cdb2ed1abdf258a730","source":{"kind":"arxiv","id":"1406.3514","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3514","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3514v2","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3514","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"NNKIHIOIYTLP","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NNKIHIOIYTLP2M7P","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NNKIHIOI","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NNKIHIOIYTLP2M7PQPG7U6MPRV","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-13T12:01:30Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"8ae727cceb596d8879dcffc79c43cbe31af2d046ba7efe43588a58f9983124e6","abstract_canon_sha256":"b4aca27eb9ae2d8e513ea11ae3decc6ccf8eeba61aae9efe4307786edb652f59"},"schema_version":"1.0"},"canonical_sha256":"6b5483a1c8c4d6fd33ef83cdfa798f8d76678677454343cdb2ed1abdf258a730","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.519509Z","signature_b64":"MSorZL9ZqRwaaOs2juWVUxAqVKriMtNkMr6oaphznHYzX86lDr9HiPk8Lh837QqATRYWgFBSgbD1nPf95zBdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5483a1c8c4d6fd33ef83cdfa798f8d76678677454343cdb2ed1abdf258a730","last_reissued_at":"2026-05-18T01:09:55.518863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.518863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3514","source_version":2,"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-18T01:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ETPZaOmA8lVelkkizbMDwLDwhSRy7d+AwugMdqggMAZ632S37kW0WMFULb6PDZV3d7AcBEUBhhOi0edmxAYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:56:19.931353Z"},"content_sha256":"f5e5f50cb6c1c6d7f628b62cd4dc2e8e6ae4f5f6f462a24e98e70b7257b70d73","schema_version":"1.0","event_id":"sha256:f5e5f50cb6c1c6d7f628b62cd4dc2e8e6ae4f5f6f462a24e98e70b7257b70d73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NNKIHIOIYTLP2M7PQPG7U6MPRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limits of CSP Problems and Efficient Parameter Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Marek Karpinski, Roland Mark\\'o","submitted_at":"2014-06-13T12:01:30Z","abstract_excerpt":"We present a unified framework on the limits of constraint satisfaction problems (CSPs) and efficient parameter testing which depends only on array exchangeability and the method of cut decomposition without recourse to the weakly regular partitions. In particular, we formulate and prove a representation theorem for compact colored $r$-uniform directed hypergraph ($r$-graph) limits, and apply this to $r$CSP limits. We investigate the sample complexity of testable $r$-graph parameters, we discuss the generalized ground state energies and demonstrate that they are efficiently testable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3514","kind":"arxiv","version":2},"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-18T01:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lz8uDjU7aFqo64dbo4IUArC30BIgrJk51HKAvU8eenxZ/pzU/yTwIJlVk83rrmedfDo9veeJ+59WCictIhmgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:56:19.931713Z"},"content_sha256":"7b32e8995b1640c5e4c9e5a06a453ef35883cc569113b52ca8c6b33270a1c5d1","schema_version":"1.0","event_id":"sha256:7b32e8995b1640c5e4c9e5a06a453ef35883cc569113b52ca8c6b33270a1c5d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNKIHIOIYTLP2M7PQPG7U6MPRV/bundle.json","state_url":"https://pith.science/pith/NNKIHIOIYTLP2M7PQPG7U6MPRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNKIHIOIYTLP2M7PQPG7U6MPRV/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-28T13:56:19Z","links":{"resolver":"https://pith.science/pith/NNKIHIOIYTLP2M7PQPG7U6MPRV","bundle":"https://pith.science/pith/NNKIHIOIYTLP2M7PQPG7U6MPRV/bundle.json","state":"https://pith.science/pith/NNKIHIOIYTLP2M7PQPG7U6MPRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNKIHIOIYTLP2M7PQPG7U6MPRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NNKIHIOIYTLP2M7PQPG7U6MPRV","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":"b4aca27eb9ae2d8e513ea11ae3decc6ccf8eeba61aae9efe4307786edb652f59","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-13T12:01:30Z","title_canon_sha256":"8ae727cceb596d8879dcffc79c43cbe31af2d046ba7efe43588a58f9983124e6"},"schema_version":"1.0","source":{"id":"1406.3514","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3514","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3514v2","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3514","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"NNKIHIOIYTLP","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NNKIHIOIYTLP2M7P","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NNKIHIOI","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:7b32e8995b1640c5e4c9e5a06a453ef35883cc569113b52ca8c6b33270a1c5d1","target":"graph","created_at":"2026-05-18T01:09:55Z","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":"We present a unified framework on the limits of constraint satisfaction problems (CSPs) and efficient parameter testing which depends only on array exchangeability and the method of cut decomposition without recourse to the weakly regular partitions. In particular, we formulate and prove a representation theorem for compact colored $r$-uniform directed hypergraph ($r$-graph) limits, and apply this to $r$CSP limits. We investigate the sample complexity of testable $r$-graph parameters, we discuss the generalized ground state energies and demonstrate that they are efficiently testable.","authors_text":"Marek Karpinski, Roland Mark\\'o","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-13T12:01:30Z","title":"Limits of CSP Problems and Efficient Parameter Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3514","kind":"arxiv","version":2},"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:f5e5f50cb6c1c6d7f628b62cd4dc2e8e6ae4f5f6f462a24e98e70b7257b70d73","target":"record","created_at":"2026-05-18T01:09:55Z","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":"b4aca27eb9ae2d8e513ea11ae3decc6ccf8eeba61aae9efe4307786edb652f59","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-13T12:01:30Z","title_canon_sha256":"8ae727cceb596d8879dcffc79c43cbe31af2d046ba7efe43588a58f9983124e6"},"schema_version":"1.0","source":{"id":"1406.3514","kind":"arxiv","version":2}},"canonical_sha256":"6b5483a1c8c4d6fd33ef83cdfa798f8d76678677454343cdb2ed1abdf258a730","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b5483a1c8c4d6fd33ef83cdfa798f8d76678677454343cdb2ed1abdf258a730","first_computed_at":"2026-05-18T01:09:55.518863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:55.518863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MSorZL9ZqRwaaOs2juWVUxAqVKriMtNkMr6oaphznHYzX86lDr9HiPk8Lh837QqATRYWgFBSgbD1nPf95zBdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:55.519509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3514","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5e5f50cb6c1c6d7f628b62cd4dc2e8e6ae4f5f6f462a24e98e70b7257b70d73","sha256:7b32e8995b1640c5e4c9e5a06a453ef35883cc569113b52ca8c6b33270a1c5d1"],"state_sha256":"ff8de2def9be7b107efde86570c4efc140f4e728d62f8d856815976a11719544"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vajsRCOMZftnWj/rhHhUyzvbGJDAPFfdGyWVTQ7EoGEn7H3nXLbhH78OtHzOm/NFyMlk3qqvSxIBmHi0kkbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:56:19.933667Z","bundle_sha256":"f79b86259adaea9fc996b7bba5c5870b39f89247ab45cd2e8e179f2165633cc6"}}