{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C7J3OXCN54SOFRBYX5CBAIJFPD","short_pith_number":"pith:C7J3OXCN","schema_version":"1.0","canonical_sha256":"17d3b75c4def24e2c438bf4410212578ef9df7e91deb5383b87997fd4fc2970c","source":{"kind":"arxiv","id":"1312.0132","version":2},"attestation_state":"computed","paper":{"title":"Critical Graphs in Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Gohari, Amirbehshad Shahrasbi, Mehrdad Tahmasbi","submitted_at":"2013-11-30T17:46:54Z","abstract_excerpt":"In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups. For the case of equal rates, we find the critical graph with minimum number of edges for both one-shot and asymptotic cases. For the general case of possibly distinct rates, we show that for one-shot and asymptotic linear index coding, as well as asymptotic non-linear index coding, each critical graph is a union of disjoint strongly connected subgraphs (USCS). On the other hand, we identify a non-USCS critical grap"},"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":"1312.0132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-30T17:46:54Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"c3f4bd397c9b8c3612031e21709995df7f305f904f79ffd42733b3feaf2ee48b","abstract_canon_sha256":"7f175afab68abbb29d69bddb5f624acc17e25cd8c2a51f061c3050ded796211c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:21.073150Z","signature_b64":"+qF3Z9gNEQOvafktjRcT6Om+5eq2G+cIHOJcL1+IhzZ7EXBuF9uTAFZLSqQuq79kefj0b4U8If3GWVDeeL+wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17d3b75c4def24e2c438bf4410212578ef9df7e91deb5383b87997fd4fc2970c","last_reissued_at":"2026-05-18T02:54:21.072772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:21.072772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Critical Graphs in Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Gohari, Amirbehshad Shahrasbi, Mehrdad Tahmasbi","submitted_at":"2013-11-30T17:46:54Z","abstract_excerpt":"In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups. For the case of equal rates, we find the critical graph with minimum number of edges for both one-shot and asymptotic cases. For the general case of possibly distinct rates, we show that for one-shot and asymptotic linear index coding, as well as asymptotic non-linear index coding, each critical graph is a union of disjoint strongly connected subgraphs (USCS). On the other hand, we identify a non-USCS critical grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0132","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.0132","created_at":"2026-05-18T02:54:21.072836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0132v2","created_at":"2026-05-18T02:54:21.072836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0132","created_at":"2026-05-18T02:54:21.072836+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7J3OXCN54SO","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7J3OXCN54SOFRBY","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7J3OXCN","created_at":"2026-05-18T12:27:40.988391+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/C7J3OXCN54SOFRBYX5CBAIJFPD","json":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD.json","graph_json":"https://pith.science/api/pith-number/C7J3OXCN54SOFRBYX5CBAIJFPD/graph.json","events_json":"https://pith.science/api/pith-number/C7J3OXCN54SOFRBYX5CBAIJFPD/events.json","paper":"https://pith.science/paper/C7J3OXCN"},"agent_actions":{"view_html":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD","download_json":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD.json","view_paper":"https://pith.science/paper/C7J3OXCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0132&json=true","fetch_graph":"https://pith.science/api/pith-number/C7J3OXCN54SOFRBYX5CBAIJFPD/graph.json","fetch_events":"https://pith.science/api/pith-number/C7J3OXCN54SOFRBYX5CBAIJFPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/action/storage_attestation","attest_author":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/action/author_attestation","sign_citation":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/action/citation_signature","submit_replication":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/action/replication_record"}},"created_at":"2026-05-18T02:54:21.072836+00:00","updated_at":"2026-05-18T02:54:21.072836+00:00"}