{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PCCNLPBHBAQW4H2ORVRWXCAFEX","short_pith_number":"pith:PCCNLPBH","canonical_record":{"source":{"id":"1512.09287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-31T13:32:24Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"1c5756fee1f2a6e9b0a8905031f1d5f4c32662e29d13f62f35114ea0a78e0ee9","abstract_canon_sha256":"2160a66c82acefd6dc9e42fd54ed6baef75da15efc3471b0e9a991f57c1a4d45"},"schema_version":"1.0"},"canonical_sha256":"7884d5bc2708216e1f4e8d636b880525f152902a5b6022f31c30c0b42d563547","source":{"kind":"arxiv","id":"1512.09287","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09287","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09287v2","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09287","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"PCCNLPBHBAQW","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCCNLPBHBAQW4H2O","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCCNLPBH","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PCCNLPBHBAQW4H2ORVRWXCAFEX","target":"record","payload":{"canonical_record":{"source":{"id":"1512.09287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-31T13:32:24Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"1c5756fee1f2a6e9b0a8905031f1d5f4c32662e29d13f62f35114ea0a78e0ee9","abstract_canon_sha256":"2160a66c82acefd6dc9e42fd54ed6baef75da15efc3471b0e9a991f57c1a4d45"},"schema_version":"1.0"},"canonical_sha256":"7884d5bc2708216e1f4e8d636b880525f152902a5b6022f31c30c0b42d563547","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:53.795050Z","signature_b64":"ttUgZP+ruEOflEj2VqaOi+dpOw3dYbOoCs+gbdeIl8Gkw/F1Xg3h4yPlvCjlDDtCFJ6zbGbpokhKSFL9/BYjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7884d5bc2708216e1f4e8d636b880525f152902a5b6022f31c30c0b42d563547","last_reissued_at":"2026-05-18T00:01:53.794462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:53.794462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.09287","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-18T00:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xm3pgvQzYhLxIDUq5udOWTpcUbbstN7OL5DrYHMFW5nyxSbjUishF3OTzh+RdN8qQUGRnAKuzy8Au7Tn0VuuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:44:42.795307Z"},"content_sha256":"343a23a1794ee0c2f427b412eeeeefda189aae96c5c84466f675be6545a84f55","schema_version":"1.0","event_id":"sha256:343a23a1794ee0c2f427b412eeeeefda189aae96c5c84466f675be6545a84f55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PCCNLPBHBAQW4H2ORVRWXCAFEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial covering arrays for data hiding and quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Vladimir N. Potapov","submitted_at":"2015-12-31T13:32:24Z","abstract_excerpt":"We consider the problem of finding a set (partial covering array) $S$ of vertices of the Boolean $n$-cube having cardinality $2^{n-k}$ and intersecting with maximum number of $k$-dimensional faces. We prove that the ratio between the numbers of the $k$-faces containing elements of $S$ to $k$-faces is less than $1-\\frac{1+o(1)}{\\sqrt{2\\pi k}}$ as $n\\rightarrow\\infty$ for sufficiently large $k$. The solution of the problem in the class of linear codes is found. Connections between this problem, cryptography and an efficiency of quantization are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09287","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-18T00:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SI/ncf5bjUTUXMjEWXhTEI2GT82Ayj6nHlwmHhL5QCEv9FGOtfdLd/+r27Bkww20cYKoOGYmzeGVIO4cMyVUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:44:42.795667Z"},"content_sha256":"2a51f7257ab12826dca1fd59bdf59f52e6014b94cc418ba25aedef1b04b1af69","schema_version":"1.0","event_id":"sha256:2a51f7257ab12826dca1fd59bdf59f52e6014b94cc418ba25aedef1b04b1af69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCCNLPBHBAQW4H2ORVRWXCAFEX/bundle.json","state_url":"https://pith.science/pith/PCCNLPBHBAQW4H2ORVRWXCAFEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCCNLPBHBAQW4H2ORVRWXCAFEX/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-02T05:44:42Z","links":{"resolver":"https://pith.science/pith/PCCNLPBHBAQW4H2ORVRWXCAFEX","bundle":"https://pith.science/pith/PCCNLPBHBAQW4H2ORVRWXCAFEX/bundle.json","state":"https://pith.science/pith/PCCNLPBHBAQW4H2ORVRWXCAFEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCCNLPBHBAQW4H2ORVRWXCAFEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PCCNLPBHBAQW4H2ORVRWXCAFEX","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":"2160a66c82acefd6dc9e42fd54ed6baef75da15efc3471b0e9a991f57c1a4d45","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-31T13:32:24Z","title_canon_sha256":"1c5756fee1f2a6e9b0a8905031f1d5f4c32662e29d13f62f35114ea0a78e0ee9"},"schema_version":"1.0","source":{"id":"1512.09287","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09287","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09287v2","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09287","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"PCCNLPBHBAQW","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCCNLPBHBAQW4H2O","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCCNLPBH","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:2a51f7257ab12826dca1fd59bdf59f52e6014b94cc418ba25aedef1b04b1af69","target":"graph","created_at":"2026-05-18T00:01:53Z","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 consider the problem of finding a set (partial covering array) $S$ of vertices of the Boolean $n$-cube having cardinality $2^{n-k}$ and intersecting with maximum number of $k$-dimensional faces. We prove that the ratio between the numbers of the $k$-faces containing elements of $S$ to $k$-faces is less than $1-\\frac{1+o(1)}{\\sqrt{2\\pi k}}$ as $n\\rightarrow\\infty$ for sufficiently large $k$. The solution of the problem in the class of linear codes is found. Connections between this problem, cryptography and an efficiency of quantization are discussed.","authors_text":"Vladimir N. Potapov","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-31T13:32:24Z","title":"Partial covering arrays for data hiding and quantization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09287","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:343a23a1794ee0c2f427b412eeeeefda189aae96c5c84466f675be6545a84f55","target":"record","created_at":"2026-05-18T00:01:53Z","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":"2160a66c82acefd6dc9e42fd54ed6baef75da15efc3471b0e9a991f57c1a4d45","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-31T13:32:24Z","title_canon_sha256":"1c5756fee1f2a6e9b0a8905031f1d5f4c32662e29d13f62f35114ea0a78e0ee9"},"schema_version":"1.0","source":{"id":"1512.09287","kind":"arxiv","version":2}},"canonical_sha256":"7884d5bc2708216e1f4e8d636b880525f152902a5b6022f31c30c0b42d563547","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7884d5bc2708216e1f4e8d636b880525f152902a5b6022f31c30c0b42d563547","first_computed_at":"2026-05-18T00:01:53.794462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:53.794462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ttUgZP+ruEOflEj2VqaOi+dpOw3dYbOoCs+gbdeIl8Gkw/F1Xg3h4yPlvCjlDDtCFJ6zbGbpokhKSFL9/BYjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:53.795050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09287","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:343a23a1794ee0c2f427b412eeeeefda189aae96c5c84466f675be6545a84f55","sha256:2a51f7257ab12826dca1fd59bdf59f52e6014b94cc418ba25aedef1b04b1af69"],"state_sha256":"c905c304ea1be5bda68015e8db767b16ae145ecfe308c3976df6eb56d861aeaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1uM1FjpAMrbaTVAgO2AMW4DHE4+XreydBGwJjoMzhX5s8oIC9XqgARK2Xz44IbboyQzyQeE+bj2mAjuOFD6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:44:42.797594Z","bundle_sha256":"fb3616e579ef39d1938ff828620fb1070f99efe9c2971d8bbb4a876255276326"}}