{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:77PLU57FXOAXJB7O5PXZLHO5WH","short_pith_number":"pith:77PLU57F","schema_version":"1.0","canonical_sha256":"ffdeba77e5bb817487eeebef959dddb1f955db870413d3e16b3d225f3d11405f","source":{"kind":"arxiv","id":"1412.5215","version":1},"attestation_state":"computed","paper":{"title":"Shallow Packings in Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Esther Ezra","submitted_at":"2014-12-16T22:19:40Z","abstract_excerpt":"We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let $\\V$ be a finite set system defined over an $n$-point set $X$; we view $\\V$ as a set of indicator vectors over the $n$-dimensional unit cube. A $\\delta$-separated set of $\\V$ is a subcollection $\\W$, s.t. the Hamming distance between each pair $\\uu, \\vv \\in \\W$ is greater than $\\delta$, where $\\delta > 0$ is an integer parameter. The $\\delta$-packing number is then defined as the cardinality of the largest $\\delta$-separated subcollection of $\\V$. Haussler showed an asy"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.5215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-16T22:19:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fcbea64491c78498f2b853dab4ce5e551910ad821aed5734d4f012d31c1250f0","abstract_canon_sha256":"afb970d961f06ddd7141d10faa8bbcc9640a30ddc93d43fc51f26d54f1228f8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:09.262362Z","signature_b64":"iub+TDdaqiVg41Ew7yKYqDs+mxwskES79vGh7XKedj3Ht90qWyE8GXFF3gbvDFSjn+WsC7oelVaFUUU02zlRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffdeba77e5bb817487eeebef959dddb1f955db870413d3e16b3d225f3d11405f","last_reissued_at":"2026-05-18T02:31:09.261657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:09.261657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shallow Packings in Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Esther Ezra","submitted_at":"2014-12-16T22:19:40Z","abstract_excerpt":"We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let $\\V$ be a finite set system defined over an $n$-point set $X$; we view $\\V$ as a set of indicator vectors over the $n$-dimensional unit cube. A $\\delta$-separated set of $\\V$ is a subcollection $\\W$, s.t. the Hamming distance between each pair $\\uu, \\vv \\in \\W$ is greater than $\\delta$, where $\\delta > 0$ is an integer parameter. The $\\delta$-packing number is then defined as the cardinality of the largest $\\delta$-separated subcollection of $\\V$. Haussler showed an asy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5215","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.5215","created_at":"2026-05-18T02:31:09.261780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5215v1","created_at":"2026-05-18T02:31:09.261780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5215","created_at":"2026-05-18T02:31:09.261780+00:00"},{"alias_kind":"pith_short_12","alias_value":"77PLU57FXOAX","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"77PLU57FXOAXJB7O","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"77PLU57F","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH","json":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH.json","graph_json":"https://pith.science/api/pith-number/77PLU57FXOAXJB7O5PXZLHO5WH/graph.json","events_json":"https://pith.science/api/pith-number/77PLU57FXOAXJB7O5PXZLHO5WH/events.json","paper":"https://pith.science/paper/77PLU57F"},"agent_actions":{"view_html":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH","download_json":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH.json","view_paper":"https://pith.science/paper/77PLU57F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5215&json=true","fetch_graph":"https://pith.science/api/pith-number/77PLU57FXOAXJB7O5PXZLHO5WH/graph.json","fetch_events":"https://pith.science/api/pith-number/77PLU57FXOAXJB7O5PXZLHO5WH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH/action/storage_attestation","attest_author":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH/action/author_attestation","sign_citation":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH/action/citation_signature","submit_replication":"https://pith.science/pith/77PLU57FXOAXJB7O5PXZLHO5WH/action/replication_record"}},"created_at":"2026-05-18T02:31:09.261780+00:00","updated_at":"2026-05-18T02:31:09.261780+00:00"}