{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NGNTDRASCLITQCD3B6MJXQS6FP","short_pith_number":"pith:NGNTDRAS","schema_version":"1.0","canonical_sha256":"699b31c41212d138087b0f989bc25e2bf7463097833dc873668edc23fb9fed5a","source":{"kind":"arxiv","id":"1609.02985","version":1},"attestation_state":"computed","paper":{"title":"Placement Delivery Array Design through Strong Edge Coloring of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minquan Cheng, Qifa Yan, Qingchun Chen, Xiaohu Tang","submitted_at":"2016-09-10T01:35:52Z","abstract_excerpt":"The technique of coded caching proposed by Madddah-Ali and Niesen is a promising approach to alleviate the load of networks during busy times. Recently, placement delivery array (PDA) was presented to characterize both the placement and delivery phase in a single array for the centralized coded caching algorithm. In this paper, we interpret PDA from a new perspective, i.e., the strong edge coloring of bipartite graph. We prove that, a PDA is equivalent to a strong edge colored bipartite graph. Thus, we can construct a class of PDAs from existing structures in bipartite graphs. The class includ"},"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":"1609.02985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-10T01:35:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5fc9d65df778c3d802b45fbb38785be14ac3fc4422d4026e02854a5115efdee9","abstract_canon_sha256":"945f289e13d98116d67587102fed4efb338e1ddf63ab44532078b3267c41527a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:57.079817Z","signature_b64":"LLKXl9HGODFwbK3k88BhOUDACzib1cmRnC2+h00wIj/UUdSTStgmbjd+2DhLnCSvF3CzwfCe7i5hqTvphBmBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"699b31c41212d138087b0f989bc25e2bf7463097833dc873668edc23fb9fed5a","last_reissued_at":"2026-05-18T00:23:57.079174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:57.079174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Placement Delivery Array Design through Strong Edge Coloring of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minquan Cheng, Qifa Yan, Qingchun Chen, Xiaohu Tang","submitted_at":"2016-09-10T01:35:52Z","abstract_excerpt":"The technique of coded caching proposed by Madddah-Ali and Niesen is a promising approach to alleviate the load of networks during busy times. Recently, placement delivery array (PDA) was presented to characterize both the placement and delivery phase in a single array for the centralized coded caching algorithm. In this paper, we interpret PDA from a new perspective, i.e., the strong edge coloring of bipartite graph. We prove that, a PDA is equivalent to a strong edge colored bipartite graph. Thus, we can construct a class of PDAs from existing structures in bipartite graphs. The class includ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02985","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.02985","created_at":"2026-05-18T00:23:57.079272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02985v1","created_at":"2026-05-18T00:23:57.079272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02985","created_at":"2026-05-18T00:23:57.079272+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGNTDRASCLIT","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGNTDRASCLITQCD3","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGNTDRAS","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP","json":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP.json","graph_json":"https://pith.science/api/pith-number/NGNTDRASCLITQCD3B6MJXQS6FP/graph.json","events_json":"https://pith.science/api/pith-number/NGNTDRASCLITQCD3B6MJXQS6FP/events.json","paper":"https://pith.science/paper/NGNTDRAS"},"agent_actions":{"view_html":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP","download_json":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP.json","view_paper":"https://pith.science/paper/NGNTDRAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02985&json=true","fetch_graph":"https://pith.science/api/pith-number/NGNTDRASCLITQCD3B6MJXQS6FP/graph.json","fetch_events":"https://pith.science/api/pith-number/NGNTDRASCLITQCD3B6MJXQS6FP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP/action/storage_attestation","attest_author":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP/action/author_attestation","sign_citation":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP/action/citation_signature","submit_replication":"https://pith.science/pith/NGNTDRASCLITQCD3B6MJXQS6FP/action/replication_record"}},"created_at":"2026-05-18T00:23:57.079272+00:00","updated_at":"2026-05-18T00:23:57.079272+00:00"}