{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6SBO5ISCBAQP3YMNDT3LS5EHHD","short_pith_number":"pith:6SBO5ISC","canonical_record":{"source":{"id":"1902.08041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-20T15:01:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9aa152ca4d4f5c19c255d99a13106ac1751bb3dc14656486891e0b968f616a3a","abstract_canon_sha256":"f8e6541cfc72fa9cbbc7d90a8743dd621694241e0c61d69d5bd245127c4bb0b0"},"schema_version":"1.0"},"canonical_sha256":"f482eea2420820fde18d1cf6b9748738d97eed433468b5c6002c1fbff57cf204","source":{"kind":"arxiv","id":"1902.08041","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08041","created_at":"2026-05-17T23:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08041v2","created_at":"2026-05-17T23:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08041","created_at":"2026-05-17T23:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"6SBO5ISCBAQP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6SBO5ISCBAQP3YMN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6SBO5ISC","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6SBO5ISCBAQP3YMNDT3LS5EHHD","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-20T15:01:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9aa152ca4d4f5c19c255d99a13106ac1751bb3dc14656486891e0b968f616a3a","abstract_canon_sha256":"f8e6541cfc72fa9cbbc7d90a8743dd621694241e0c61d69d5bd245127c4bb0b0"},"schema_version":"1.0"},"canonical_sha256":"f482eea2420820fde18d1cf6b9748738d97eed433468b5c6002c1fbff57cf204","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:52.009508Z","signature_b64":"7ze1/gy17PXD9fphWouClEvVB/Xv8Ty6pKk/MeOdFlaKN6ZQvIGZYVspKgNkH4vh0pzwpB/5TDqjJZ+7zTncAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f482eea2420820fde18d1cf6b9748738d97eed433468b5c6002c1fbff57cf204","last_reissued_at":"2026-05-17T23:51:52.008833Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:52.008833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08041","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-17T23:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTbUcCrucffpSrLJEnAr7kLduSOYrHIl7u5FS7/zTx5oUQvAYAEeZPxRamYYWAm07NJWguuPRSFag5KvdzUvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:18:40.994775Z"},"content_sha256":"bbab45821c1d1162f1d56a70c65090df67e7e7860958cbd5340dd14b3ca93267","schema_version":"1.0","event_id":"sha256:bbab45821c1d1162f1d56a70c65090df67e7e7860958cbd5340dd14b3ca93267"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6SBO5ISCBAQP3YMNDT3LS5EHHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Subpacketization Coded Caching via Projective Geometry for Broadcast and D2D networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hari Hara Suthan Chittoor, Prasad Krishnan","submitted_at":"2019-02-20T15:01:17Z","abstract_excerpt":"Coded caching was introduced as a technique of systematically exploiting locally available storage at the clients to increase the channel throughput via coded transmissions. Most known coded caching schemes in literature enable large gains in terms of the rate, however at the cost of subpacketization that is exponential in $K^{\\frac{1}{r}}$ ($K$ being the number of clients, $r$ some positive integer). Building upon recent prior work for coded caching design via line graphs and finite-field projective geometries, we present a new scheme in this work which achieves a subexponential (in $K$) subp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08041","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-17T23:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ipgav15bTARl5y31tFIBHYhEc9RpU17bWymQjyvvNVdrFaTPR6WVppNAfUI3CK0MY2YdJNZf1zKSFLoMkogkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:18:40.995131Z"},"content_sha256":"5d5e31aac59b8c246ffeda18e0ed91919ee31b39f2a3dae1debd78a389e0bead","schema_version":"1.0","event_id":"sha256:5d5e31aac59b8c246ffeda18e0ed91919ee31b39f2a3dae1debd78a389e0bead"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SBO5ISCBAQP3YMNDT3LS5EHHD/bundle.json","state_url":"https://pith.science/pith/6SBO5ISCBAQP3YMNDT3LS5EHHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SBO5ISCBAQP3YMNDT3LS5EHHD/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-23T12:18:40Z","links":{"resolver":"https://pith.science/pith/6SBO5ISCBAQP3YMNDT3LS5EHHD","bundle":"https://pith.science/pith/6SBO5ISCBAQP3YMNDT3LS5EHHD/bundle.json","state":"https://pith.science/pith/6SBO5ISCBAQP3YMNDT3LS5EHHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SBO5ISCBAQP3YMNDT3LS5EHHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6SBO5ISCBAQP3YMNDT3LS5EHHD","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":"f8e6541cfc72fa9cbbc7d90a8743dd621694241e0c61d69d5bd245127c4bb0b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-20T15:01:17Z","title_canon_sha256":"9aa152ca4d4f5c19c255d99a13106ac1751bb3dc14656486891e0b968f616a3a"},"schema_version":"1.0","source":{"id":"1902.08041","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08041","created_at":"2026-05-17T23:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08041v2","created_at":"2026-05-17T23:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08041","created_at":"2026-05-17T23:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"6SBO5ISCBAQP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6SBO5ISCBAQP3YMN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6SBO5ISC","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:5d5e31aac59b8c246ffeda18e0ed91919ee31b39f2a3dae1debd78a389e0bead","target":"graph","created_at":"2026-05-17T23:51:52Z","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":"Coded caching was introduced as a technique of systematically exploiting locally available storage at the clients to increase the channel throughput via coded transmissions. Most known coded caching schemes in literature enable large gains in terms of the rate, however at the cost of subpacketization that is exponential in $K^{\\frac{1}{r}}$ ($K$ being the number of clients, $r$ some positive integer). Building upon recent prior work for coded caching design via line graphs and finite-field projective geometries, we present a new scheme in this work which achieves a subexponential (in $K$) subp","authors_text":"Hari Hara Suthan Chittoor, Prasad Krishnan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-20T15:01:17Z","title":"Low Subpacketization Coded Caching via Projective Geometry for Broadcast and D2D networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08041","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:bbab45821c1d1162f1d56a70c65090df67e7e7860958cbd5340dd14b3ca93267","target":"record","created_at":"2026-05-17T23:51:52Z","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":"f8e6541cfc72fa9cbbc7d90a8743dd621694241e0c61d69d5bd245127c4bb0b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-20T15:01:17Z","title_canon_sha256":"9aa152ca4d4f5c19c255d99a13106ac1751bb3dc14656486891e0b968f616a3a"},"schema_version":"1.0","source":{"id":"1902.08041","kind":"arxiv","version":2}},"canonical_sha256":"f482eea2420820fde18d1cf6b9748738d97eed433468b5c6002c1fbff57cf204","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f482eea2420820fde18d1cf6b9748738d97eed433468b5c6002c1fbff57cf204","first_computed_at":"2026-05-17T23:51:52.008833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:52.008833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ze1/gy17PXD9fphWouClEvVB/Xv8Ty6pKk/MeOdFlaKN6ZQvIGZYVspKgNkH4vh0pzwpB/5TDqjJZ+7zTncAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:52.009508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08041","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbab45821c1d1162f1d56a70c65090df67e7e7860958cbd5340dd14b3ca93267","sha256:5d5e31aac59b8c246ffeda18e0ed91919ee31b39f2a3dae1debd78a389e0bead"],"state_sha256":"6d16eab2ffac191366294f1c6f5a1dfa1d987053b87fbba87ca16e29dbf73b37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P39THRmU5ylrEPKZzCpiS0QijkiVCbL0ZrmPvh7eLVV8IR0P07TmhyrqP8eALrz9hyHWzZoT7JRuc8bBXf4zAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:18:40.997104Z","bundle_sha256":"b9a4489fe25eb1fa5901c91ca1a1a07f25edd4a11c41c90bf131f8655cc30688"}}