{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4T3EX2XT72TP6ZMUSVZFGLP4LD","short_pith_number":"pith:4T3EX2XT","schema_version":"1.0","canonical_sha256":"e4f64beaf3fea6ff65949572532dfc58e574ae9df23058961cec1ea0abe46845","source":{"kind":"arxiv","id":"1904.11159","version":2},"attestation_state":"computed","paper":{"title":"Moments of isotropic measures and optimal projective codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Alexey Glazyrin","submitted_at":"2019-04-25T05:20:40Z","abstract_excerpt":"In this paper, we use the linear programming approach to find new upper bounds for the moments of isotropic measures. These bounds are then utilized for finding lower packing bounds and energy bounds for projective codes. We also show that the obtained energy bounds are sharp for several infinite families of codes."},"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":"1904.11159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-04-25T05:20:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8a6a44cca29a0cd42188c960c219ff7920162d6ed9d16fc0d4df417bc4a7022d","abstract_canon_sha256":"66db137af40fcf33f165351bed0108df626dfcb672de8667cb663aad30ddb1a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:02:50.211910Z","signature_b64":"EQPuZKe1qEH0tcFJ7G9skcbWPi01e/leC52p721Xy/WDC11pF5AGOyv+ly6ZSXP+n/twN/zixSIcD+oUY9GECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4f64beaf3fea6ff65949572532dfc58e574ae9df23058961cec1ea0abe46845","last_reissued_at":"2026-07-05T02:02:50.211348Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:02:50.211348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moments of isotropic measures and optimal projective codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Alexey Glazyrin","submitted_at":"2019-04-25T05:20:40Z","abstract_excerpt":"In this paper, we use the linear programming approach to find new upper bounds for the moments of isotropic measures. These bounds are then utilized for finding lower packing bounds and energy bounds for projective codes. We also show that the obtained energy bounds are sharp for several infinite families of codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11159","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.11159/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.11159","created_at":"2026-07-05T02:02:50.211405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11159v2","created_at":"2026-07-05T02:02:50.211405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11159","created_at":"2026-07-05T02:02:50.211405+00:00"},{"alias_kind":"pith_short_12","alias_value":"4T3EX2XT72TP","created_at":"2026-07-05T02:02:50.211405+00:00"},{"alias_kind":"pith_short_16","alias_value":"4T3EX2XT72TP6ZMU","created_at":"2026-07-05T02:02:50.211405+00:00"},{"alias_kind":"pith_short_8","alias_value":"4T3EX2XT","created_at":"2026-07-05T02:02:50.211405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.07848","citing_title":"Game of Sloanes: Best known packings in complex projective space","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD","json":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD.json","graph_json":"https://pith.science/api/pith-number/4T3EX2XT72TP6ZMUSVZFGLP4LD/graph.json","events_json":"https://pith.science/api/pith-number/4T3EX2XT72TP6ZMUSVZFGLP4LD/events.json","paper":"https://pith.science/paper/4T3EX2XT"},"agent_actions":{"view_html":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD","download_json":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD.json","view_paper":"https://pith.science/paper/4T3EX2XT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11159&json=true","fetch_graph":"https://pith.science/api/pith-number/4T3EX2XT72TP6ZMUSVZFGLP4LD/graph.json","fetch_events":"https://pith.science/api/pith-number/4T3EX2XT72TP6ZMUSVZFGLP4LD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD/action/storage_attestation","attest_author":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD/action/author_attestation","sign_citation":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD/action/citation_signature","submit_replication":"https://pith.science/pith/4T3EX2XT72TP6ZMUSVZFGLP4LD/action/replication_record"}},"created_at":"2026-07-05T02:02:50.211405+00:00","updated_at":"2026-07-05T02:02:50.211405+00:00"}