{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EEYUBZJPAYP3QTALRHNMIG3RAN","short_pith_number":"pith:EEYUBZJP","canonical_record":{"source":{"id":"1901.07823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T11:20:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74dfdee8de36082781255fcc87e3ba46c2aef085f24cbb736e7f09a8a833cc0e","abstract_canon_sha256":"84ac318b4dfa7b6af231aab7eb40f5de1710e4e27262ab96d654b2f8a98656bd"},"schema_version":"1.0"},"canonical_sha256":"213140e52f061fb84c0b89dac41b710348ce9e922d1742f33f905a201d91e151","source":{"kind":"arxiv","id":"1901.07823","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07823","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07823v2","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07823","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"EEYUBZJPAYP3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EEYUBZJPAYP3QTAL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EEYUBZJP","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EEYUBZJPAYP3QTALRHNMIG3RAN","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T11:20:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74dfdee8de36082781255fcc87e3ba46c2aef085f24cbb736e7f09a8a833cc0e","abstract_canon_sha256":"84ac318b4dfa7b6af231aab7eb40f5de1710e4e27262ab96d654b2f8a98656bd"},"schema_version":"1.0"},"canonical_sha256":"213140e52f061fb84c0b89dac41b710348ce9e922d1742f33f905a201d91e151","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:51.039368Z","signature_b64":"nDQwOdlCbP+f9nINdaryrUxrSO6OY3O0ClccHs70ITVKkN7hgatUHt/OgZ2tvE0LSUtp4Hi82YhTXzYCJsEBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213140e52f061fb84c0b89dac41b710348ce9e922d1742f33f905a201d91e151","last_reissued_at":"2026-05-17T23:52:51.038451Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:51.038451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07823","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:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9K6M+TYdvi7ddt7+1baKJcAntcEOQ2c8igzCvDfQAwTeT9Z38bC8VYNIpfU6Giyh/QTlM0khpCcpUJl9UeQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:22:19.696613Z"},"content_sha256":"e730835b119a35f178099e1d29a055f66157cb0449c10c63eefbcd8b543746e6","schema_version":"1.0","event_id":"sha256:e730835b119a35f178099e1d29a055f66157cb0449c10c63eefbcd8b543746e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EEYUBZJPAYP3QTALRHNMIG3RAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Caching via Projective Geometry: A new low subpacketization scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bhavana M, Hari Hara Suthan Chittoor, Prasad Krishnan","submitted_at":"2019-01-23T11:20:37Z","abstract_excerpt":"Coded Caching is a promising solution to reduce the peak traffic in broadcast networks by prefetching the popular content close to end users and using coded transmissions. One of the chief issues of most coded caching schemes in literature is the issue of large $\\textit{subpacketization}$, i.e., they require each file to be divided into a large number of subfiles. In this work, we present a coded caching scheme using line graphs of bipartite graphs in conjunction with projective geometries over finite fields. The presented scheme achieves a rate $\\Theta(\\frac{K}{\\log_q{K}})$ ($K$ being the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07823","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:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+2YfwlZy1cchOa3CxFPYEoUyVdNsWlW00q7eAfVeKONAp44TMV/nkZaHHs9Ka8NwsfVk8pi/Que1UJrsu36Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:22:19.696962Z"},"content_sha256":"7702ef4cc18ccc57674e4ef74e35ab6e6251669401d1c5466ed7113c2983c1ac","schema_version":"1.0","event_id":"sha256:7702ef4cc18ccc57674e4ef74e35ab6e6251669401d1c5466ed7113c2983c1ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEYUBZJPAYP3QTALRHNMIG3RAN/bundle.json","state_url":"https://pith.science/pith/EEYUBZJPAYP3QTALRHNMIG3RAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEYUBZJPAYP3QTALRHNMIG3RAN/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-23T16:22:19Z","links":{"resolver":"https://pith.science/pith/EEYUBZJPAYP3QTALRHNMIG3RAN","bundle":"https://pith.science/pith/EEYUBZJPAYP3QTALRHNMIG3RAN/bundle.json","state":"https://pith.science/pith/EEYUBZJPAYP3QTALRHNMIG3RAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEYUBZJPAYP3QTALRHNMIG3RAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EEYUBZJPAYP3QTALRHNMIG3RAN","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":"84ac318b4dfa7b6af231aab7eb40f5de1710e4e27262ab96d654b2f8a98656bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T11:20:37Z","title_canon_sha256":"74dfdee8de36082781255fcc87e3ba46c2aef085f24cbb736e7f09a8a833cc0e"},"schema_version":"1.0","source":{"id":"1901.07823","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07823","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07823v2","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07823","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"EEYUBZJPAYP3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EEYUBZJPAYP3QTAL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EEYUBZJP","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:7702ef4cc18ccc57674e4ef74e35ab6e6251669401d1c5466ed7113c2983c1ac","target":"graph","created_at":"2026-05-17T23:52:51Z","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 is a promising solution to reduce the peak traffic in broadcast networks by prefetching the popular content close to end users and using coded transmissions. One of the chief issues of most coded caching schemes in literature is the issue of large $\\textit{subpacketization}$, i.e., they require each file to be divided into a large number of subfiles. In this work, we present a coded caching scheme using line graphs of bipartite graphs in conjunction with projective geometries over finite fields. The presented scheme achieves a rate $\\Theta(\\frac{K}{\\log_q{K}})$ ($K$ being the num","authors_text":"Bhavana M, 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-01-23T11:20:37Z","title":"Coded Caching via Projective Geometry: A new low subpacketization scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07823","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:e730835b119a35f178099e1d29a055f66157cb0449c10c63eefbcd8b543746e6","target":"record","created_at":"2026-05-17T23:52:51Z","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":"84ac318b4dfa7b6af231aab7eb40f5de1710e4e27262ab96d654b2f8a98656bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T11:20:37Z","title_canon_sha256":"74dfdee8de36082781255fcc87e3ba46c2aef085f24cbb736e7f09a8a833cc0e"},"schema_version":"1.0","source":{"id":"1901.07823","kind":"arxiv","version":2}},"canonical_sha256":"213140e52f061fb84c0b89dac41b710348ce9e922d1742f33f905a201d91e151","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"213140e52f061fb84c0b89dac41b710348ce9e922d1742f33f905a201d91e151","first_computed_at":"2026-05-17T23:52:51.038451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:51.038451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nDQwOdlCbP+f9nINdaryrUxrSO6OY3O0ClccHs70ITVKkN7hgatUHt/OgZ2tvE0LSUtp4Hi82YhTXzYCJsEBCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:51.039368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07823","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e730835b119a35f178099e1d29a055f66157cb0449c10c63eefbcd8b543746e6","sha256:7702ef4cc18ccc57674e4ef74e35ab6e6251669401d1c5466ed7113c2983c1ac"],"state_sha256":"848623257fda1c108d1937d6802c1e61b3720bb03d68fed2e15bc2780fb5da1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXkk8NY4KQlxSGUQABsquZR/biZ/DKVZn3b2PAF5MaZQQchzNgusXRL3Dvx8iMNrxstCLSmdmxDyJ2O4jXJYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:22:19.699116Z","bundle_sha256":"ea00dff54b7a5847ef9b67a9c87835784b96807b340ca346f8e7c154ecbb4070"}}