{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YETYXRVKWQXRXB6HAUTLVIYLVV","short_pith_number":"pith:YETYXRVK","canonical_record":{"source":{"id":"1908.08792","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-22T09:48:23Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"819b2c805f922907612c888325df6eedde3ae147a3813de7c7fc0f21580c6d23","abstract_canon_sha256":"c3d3e505f26245168b16bf30da081ef168d70d656b835025b5732cf867e3921e"},"schema_version":"1.0"},"canonical_sha256":"c1278bc6aab42f1b87c70526baa30bad5062174ef459693b4947fb1764b88dbb","source":{"kind":"arxiv","id":"1908.08792","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08792","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08792v5","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08792","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"YETYXRVKWQXR","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"pith_short_16","alias_value":"YETYXRVKWQXRXB6H","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"pith_short_8","alias_value":"YETYXRVK","created_at":"2026-07-05T05:47:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YETYXRVKWQXRXB6HAUTLVIYLVV","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08792","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-22T09:48:23Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"819b2c805f922907612c888325df6eedde3ae147a3813de7c7fc0f21580c6d23","abstract_canon_sha256":"c3d3e505f26245168b16bf30da081ef168d70d656b835025b5732cf867e3921e"},"schema_version":"1.0"},"canonical_sha256":"c1278bc6aab42f1b87c70526baa30bad5062174ef459693b4947fb1764b88dbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:12.991934Z","signature_b64":"t/0Knkom7yqVQyBG2Nm+Pa5vIzkHqZyixCDKLemPLXoazBzVTO9Q808qz61pnK0s83C+PUBfqHsaZWN3ObQLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1278bc6aab42f1b87c70526baa30bad5062174ef459693b4947fb1764b88dbb","last_reissued_at":"2026-07-05T05:47:12.991244Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:12.991244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08792","source_version":5,"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-07-05T05:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4+fPPLE5u72bTecGjmjXnOOiogiAtm1hev5uE8iJPQpMsdPJZZEqHt+JEm6k/Mox/wgR0l+NY98sgXGTOFLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:51:00.067890Z"},"content_sha256":"aadb8d2e416cd3579b84f96d6bff03d5839df88c75a918201176bdb2a89da439","schema_version":"1.0","event_id":"sha256:aadb8d2e416cd3579b84f96d6bff03d5839df88c75a918201176bdb2a89da439"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YETYXRVKWQXRXB6HAUTLVIYLVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beating the probabilistic lower bound on $q$-perfect hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan","submitted_at":"2019-08-22T09:48:23Z","abstract_excerpt":"For an integer $q\\ge 2$, a perfect $q$-hash code $C$ is a block code over $[q]:=\\{1,\\ldots,q\\}$ of length $n$ in which every subset $\\{\\mathbf{c}_1,\\mathbf{c}_2,\\dots,\\mathbf{c}_q\\}$ of $q$ elements is separated, i.e., there exists $i\\in[n]$ such that $\\{\\mathrm{proj}_i(\\mathbf{c}_1),\\dots,\\mathrm{proj}_i(\\mathbf{c}_q)\\}=[q]$, where $\\mathrm{proj}_i(\\mathbf{c}_j)$ denotes the $i$th position of $\\mathbf{c}_j$. Finding the maximum size $M(n,q)$ of perfect $q$-hash codes of length $n$, for given $q$ and $n$, is a fundamental problem in combinatorics, information theory, and computer science. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08792","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08792/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwPRr4weRWNkO7417U+mbn6GCY5EELNyd9cM/Uub6pYwjIEIe8683Ug52r+k56JnSqnpSHkX8edSlHy0MX+WBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:51:00.068937Z"},"content_sha256":"1b84bcf16e6e8e8e315cc1ce8a3fb994d752cdbe5c2d87a7e262996ac6e20c13","schema_version":"1.0","event_id":"sha256:1b84bcf16e6e8e8e315cc1ce8a3fb994d752cdbe5c2d87a7e262996ac6e20c13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YETYXRVKWQXRXB6HAUTLVIYLVV/bundle.json","state_url":"https://pith.science/pith/YETYXRVKWQXRXB6HAUTLVIYLVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YETYXRVKWQXRXB6HAUTLVIYLVV/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-08-20T08:51:00Z","links":{"resolver":"https://pith.science/pith/YETYXRVKWQXRXB6HAUTLVIYLVV","bundle":"https://pith.science/pith/YETYXRVKWQXRXB6HAUTLVIYLVV/bundle.json","state":"https://pith.science/pith/YETYXRVKWQXRXB6HAUTLVIYLVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YETYXRVKWQXRXB6HAUTLVIYLVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YETYXRVKWQXRXB6HAUTLVIYLVV","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":"c3d3e505f26245168b16bf30da081ef168d70d656b835025b5732cf867e3921e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-22T09:48:23Z","title_canon_sha256":"819b2c805f922907612c888325df6eedde3ae147a3813de7c7fc0f21580c6d23"},"schema_version":"1.0","source":{"id":"1908.08792","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08792","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08792v5","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08792","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"YETYXRVKWQXR","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"pith_short_16","alias_value":"YETYXRVKWQXRXB6H","created_at":"2026-07-05T05:47:12Z"},{"alias_kind":"pith_short_8","alias_value":"YETYXRVK","created_at":"2026-07-05T05:47:12Z"}],"graph_snapshots":[{"event_id":"sha256:1b84bcf16e6e8e8e315cc1ce8a3fb994d752cdbe5c2d87a7e262996ac6e20c13","target":"graph","created_at":"2026-07-05T05:47:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08792/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For an integer $q\\ge 2$, a perfect $q$-hash code $C$ is a block code over $[q]:=\\{1,\\ldots,q\\}$ of length $n$ in which every subset $\\{\\mathbf{c}_1,\\mathbf{c}_2,\\dots,\\mathbf{c}_q\\}$ of $q$ elements is separated, i.e., there exists $i\\in[n]$ such that $\\{\\mathrm{proj}_i(\\mathbf{c}_1),\\dots,\\mathrm{proj}_i(\\mathbf{c}_q)\\}=[q]$, where $\\mathrm{proj}_i(\\mathbf{c}_j)$ denotes the $i$th position of $\\mathbf{c}_j$. Finding the maximum size $M(n,q)$ of perfect $q$-hash codes of length $n$, for given $q$ and $n$, is a fundamental problem in combinatorics, information theory, and computer science. In t","authors_text":"Chaoping Xing, Chen Yuan","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-22T09:48:23Z","title":"Beating the probabilistic lower bound on $q$-perfect hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08792","kind":"arxiv","version":5},"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:aadb8d2e416cd3579b84f96d6bff03d5839df88c75a918201176bdb2a89da439","target":"record","created_at":"2026-07-05T05:47:12Z","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":"c3d3e505f26245168b16bf30da081ef168d70d656b835025b5732cf867e3921e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-22T09:48:23Z","title_canon_sha256":"819b2c805f922907612c888325df6eedde3ae147a3813de7c7fc0f21580c6d23"},"schema_version":"1.0","source":{"id":"1908.08792","kind":"arxiv","version":5}},"canonical_sha256":"c1278bc6aab42f1b87c70526baa30bad5062174ef459693b4947fb1764b88dbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1278bc6aab42f1b87c70526baa30bad5062174ef459693b4947fb1764b88dbb","first_computed_at":"2026-07-05T05:47:12.991244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:47:12.991244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/0Knkom7yqVQyBG2Nm+Pa5vIzkHqZyixCDKLemPLXoazBzVTO9Q808qz61pnK0s83C+PUBfqHsaZWN3ObQLAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:47:12.991934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08792","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aadb8d2e416cd3579b84f96d6bff03d5839df88c75a918201176bdb2a89da439","sha256:1b84bcf16e6e8e8e315cc1ce8a3fb994d752cdbe5c2d87a7e262996ac6e20c13"],"state_sha256":"c1a5b1563f9a7eb891294beea0d36b01536bed244f64a786ff8762580f66cf7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxbp8wm4MQnbtLb0kE/HXzOuZ8Mj/bL1PectiaSARuo7Oyi+W8ZxSRinXOmFxGCT8qaZn0aDNED0DMu01ZGPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T08:51:00.076140Z","bundle_sha256":"0d12ef69ab64be58471013d25523c1e38d8341b9cd15f7da6fc60dd7dee56480"}}