{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TDLV3EDFYDGIRD7UBYKT2POTUC","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":"0e13dfa2cfb0d6ceb0a0f062930528959a0367ca092258a617f903058c926fde","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-23T04:14:34Z","title_canon_sha256":"034275f7a427dd028044f15d102b91fe8dbb2b2812e800ef37b9541d808b1486"},"schema_version":"1.0","source":{"id":"1805.08955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08955","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08955v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08955","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"TDLV3EDFYDGI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TDLV3EDFYDGIRD7U","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TDLV3EDF","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:cb96517aeac71213ace74b416df5f870bc1f976ae97852d065f88b926914f09e","target":"graph","created_at":"2026-05-18T00:15:08Z","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":"We present a coded caching framework using line graphs of bipartite graphs. A clique cover of the line graph describes the uncached subfiles at users. A clique cover of the complement of the square of the line graph gives a transmission scheme that satisfies user demands. We then define a specific class of such caching line graphs, for which the subpacketization, rate, and uncached fraction of the coded caching problem can be captured via its graph theoretic parameters. We present a construction of such caching line graphs using projective geometry. The presented scheme has a rate bounded from","authors_text":"Prasad Krishnan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-23T04:14:34Z","title":"Coded Caching via Line Graphs of Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08955","kind":"arxiv","version":1},"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:baa4e81dc8e03989b2b8db0b89be8bdd6c3e4aed259b8329664fc054da44919d","target":"record","created_at":"2026-05-18T00:15:08Z","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":"0e13dfa2cfb0d6ceb0a0f062930528959a0367ca092258a617f903058c926fde","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-23T04:14:34Z","title_canon_sha256":"034275f7a427dd028044f15d102b91fe8dbb2b2812e800ef37b9541d808b1486"},"schema_version":"1.0","source":{"id":"1805.08955","kind":"arxiv","version":1}},"canonical_sha256":"98d75d9065c0cc888ff40e153d3dd3a0bfd00e16d14c9c701c7e546faf4de4bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98d75d9065c0cc888ff40e153d3dd3a0bfd00e16d14c9c701c7e546faf4de4bd","first_computed_at":"2026-05-18T00:15:08.950050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.950050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VDvbD1mZp7iZ2IokXs26h5THCspt7F5fVZ5fqy9Acy/VdcFDryF6d5ITus6dtkYMaIls0ICIEH7KksPwiSgqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.950658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baa4e81dc8e03989b2b8db0b89be8bdd6c3e4aed259b8329664fc054da44919d","sha256:cb96517aeac71213ace74b416df5f870bc1f976ae97852d065f88b926914f09e"],"state_sha256":"64bb25b8ec6e76462ca74f0af5bd8eec09ee41594d6981efdb43aa3af5427b2a"}