{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IU5H7Y4RXWOFQD26NNC7P6CTC4","short_pith_number":"pith:IU5H7Y4R","canonical_record":{"source":{"id":"1908.05865","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-16T06:45:35Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"56a496f7f173cfdecd35abd7a2a8917d6335796e40463b4987be2ae5a5d7810a","abstract_canon_sha256":"f2cbb31ec9981294efee6c2ef497ff067641ba10d2264b4e1846db0db57e2e02"},"schema_version":"1.0"},"canonical_sha256":"453a7fe391bd9c580f5e6b45f7f853171eca3e1b9dd8c3cb5d8a4e9395d31c1f","source":{"kind":"arxiv","id":"1908.05865","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05865","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05865v3","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05865","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"IU5H7Y4RXWOF","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"pith_short_16","alias_value":"IU5H7Y4RXWOFQD26","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"pith_short_8","alias_value":"IU5H7Y4R","created_at":"2026-07-05T02:44:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IU5H7Y4RXWOFQD26NNC7P6CTC4","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05865","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-16T06:45:35Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"56a496f7f173cfdecd35abd7a2a8917d6335796e40463b4987be2ae5a5d7810a","abstract_canon_sha256":"f2cbb31ec9981294efee6c2ef497ff067641ba10d2264b4e1846db0db57e2e02"},"schema_version":"1.0"},"canonical_sha256":"453a7fe391bd9c580f5e6b45f7f853171eca3e1b9dd8c3cb5d8a4e9395d31c1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:30.983871Z","signature_b64":"x4lB4vEMNWD0DE4SxEsS0lLsswD4cdU8b2JjRfU3LE/5LiaE+If2Xn+s53+dCyubifVjOilY0pb3ydhCHfZrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"453a7fe391bd9c580f5e6b45f7f853171eca3e1b9dd8c3cb5d8a4e9395d31c1f","last_reissued_at":"2026-07-05T02:44:30.983376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:30.983376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05865","source_version":3,"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-07-05T02:44:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jX4s4pzUQWl2u2/Wa6uizW2DMpiyR6dYqGWxnOJAjapkyTbI+6BBxfJEU5BhQXaaEs1/Y0yOz0FrUSwXC9fvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:16:07.744265Z"},"content_sha256":"1de4fae276162a562d2a0ba9fbec18949d8aaebe9cb3b7a59dcdc3c90662f47a","schema_version":"1.0","event_id":"sha256:1de4fae276162a562d2a0ba9fbec18949d8aaebe9cb3b7a59dcdc3c90662f47a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IU5H7Y4RXWOFQD26NNC7P6CTC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A framework of constructing placement delivery arrays for centralized coded caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jinyu Wang, Minquan Cheng, Qiang Wang, Xi Zhong","submitted_at":"2019-08-16T06:45:35Z","abstract_excerpt":"In caching system, it is desirable to design a coded caching scheme with the transmission load $R$ and subpacketization $F$ as small as possible, in order to improve efficiency of transmission in the peak traffic times and to decrease implementation complexity. Yan et al. reformulated the centralized coded caching scheme as designing a corresponding $F\\times K$ array called placement delivery array (PDA), where $F$ is the subpacketization and $K$ is the number of users. Motivated by several constructions of PDAs, we introduce a framework for constructing PDAs, where each row is indexed by a ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05865","kind":"arxiv","version":3},"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/1908.05865/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"},"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-07-05T02:44:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvqJlAk2OSWCvyrO+oKFT1WIjXoJiPNMy8MwYtlvdEKpMDdD1uqa+H7Is34PUiiDAvAv5D9W10PmbB90lAhLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:16:07.744772Z"},"content_sha256":"4a5c188717060d53a3fb81bf7b752a36d702198a6818d269aeba5f55d1fc8541","schema_version":"1.0","event_id":"sha256:4a5c188717060d53a3fb81bf7b752a36d702198a6818d269aeba5f55d1fc8541"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IU5H7Y4RXWOFQD26NNC7P6CTC4/bundle.json","state_url":"https://pith.science/pith/IU5H7Y4RXWOFQD26NNC7P6CTC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IU5H7Y4RXWOFQD26NNC7P6CTC4/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-08-16T06:16:07Z","links":{"resolver":"https://pith.science/pith/IU5H7Y4RXWOFQD26NNC7P6CTC4","bundle":"https://pith.science/pith/IU5H7Y4RXWOFQD26NNC7P6CTC4/bundle.json","state":"https://pith.science/pith/IU5H7Y4RXWOFQD26NNC7P6CTC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IU5H7Y4RXWOFQD26NNC7P6CTC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IU5H7Y4RXWOFQD26NNC7P6CTC4","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":"f2cbb31ec9981294efee6c2ef497ff067641ba10d2264b4e1846db0db57e2e02","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-16T06:45:35Z","title_canon_sha256":"56a496f7f173cfdecd35abd7a2a8917d6335796e40463b4987be2ae5a5d7810a"},"schema_version":"1.0","source":{"id":"1908.05865","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05865","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05865v3","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05865","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"IU5H7Y4RXWOF","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"pith_short_16","alias_value":"IU5H7Y4RXWOFQD26","created_at":"2026-07-05T02:44:30Z"},{"alias_kind":"pith_short_8","alias_value":"IU5H7Y4R","created_at":"2026-07-05T02:44:30Z"}],"graph_snapshots":[{"event_id":"sha256:4a5c188717060d53a3fb81bf7b752a36d702198a6818d269aeba5f55d1fc8541","target":"graph","created_at":"2026-07-05T02:44:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05865/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In caching system, it is desirable to design a coded caching scheme with the transmission load $R$ and subpacketization $F$ as small as possible, in order to improve efficiency of transmission in the peak traffic times and to decrease implementation complexity. Yan et al. reformulated the centralized coded caching scheme as designing a corresponding $F\\times K$ array called placement delivery array (PDA), where $F$ is the subpacketization and $K$ is the number of users. Motivated by several constructions of PDAs, we introduce a framework for constructing PDAs, where each row is indexed by a ro","authors_text":"Jinyu Wang, Minquan Cheng, Qiang Wang, Xi Zhong","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-16T06:45:35Z","title":"A framework of constructing placement delivery arrays for centralized coded caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05865","kind":"arxiv","version":3},"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:1de4fae276162a562d2a0ba9fbec18949d8aaebe9cb3b7a59dcdc3c90662f47a","target":"record","created_at":"2026-07-05T02:44:30Z","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":"f2cbb31ec9981294efee6c2ef497ff067641ba10d2264b4e1846db0db57e2e02","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-16T06:45:35Z","title_canon_sha256":"56a496f7f173cfdecd35abd7a2a8917d6335796e40463b4987be2ae5a5d7810a"},"schema_version":"1.0","source":{"id":"1908.05865","kind":"arxiv","version":3}},"canonical_sha256":"453a7fe391bd9c580f5e6b45f7f853171eca3e1b9dd8c3cb5d8a4e9395d31c1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"453a7fe391bd9c580f5e6b45f7f853171eca3e1b9dd8c3cb5d8a4e9395d31c1f","first_computed_at":"2026-07-05T02:44:30.983376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:44:30.983376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x4lB4vEMNWD0DE4SxEsS0lLsswD4cdU8b2JjRfU3LE/5LiaE+If2Xn+s53+dCyubifVjOilY0pb3ydhCHfZrDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:44:30.983871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05865","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1de4fae276162a562d2a0ba9fbec18949d8aaebe9cb3b7a59dcdc3c90662f47a","sha256:4a5c188717060d53a3fb81bf7b752a36d702198a6818d269aeba5f55d1fc8541"],"state_sha256":"ff73f1f2db155f021549c865248ade18c9e51749a9d41706a7e7bfc233c5a870"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8eVHR/TLuGOfwCn2Mp0IjD+DLX+ITLsAsUatByF/5j1xssIlZx7yWicdV8xlyG3rAnZTzAMKUvEsiXy5At0YAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:16:07.750089Z","bundle_sha256":"4ece3639fc03f30721ea4b9de47715a796d186f26223799a711d8fb819350696"}}