{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C7J3OXCN54SOFRBYX5CBAIJFPD","short_pith_number":"pith:C7J3OXCN","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"},"canonical_sha256":"17d3b75c4def24e2c438bf4410212578ef9df7e91deb5383b87997fd4fc2970c","source":{"kind":"arxiv","id":"1312.0132","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0132","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0132v2","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0132","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"C7J3OXCN54SO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C7J3OXCN54SOFRBY","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C7J3OXCN","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C7J3OXCN54SOFRBYX5CBAIJFPD","target":"record","payload":{"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"},"canonical_sha256":"17d3b75c4def24e2c438bf4410212578ef9df7e91deb5383b87997fd4fc2970c","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"},"source_kind":"arxiv","source_id":"1312.0132","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-18T02:54:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mr+bn3N4wbd0bRUoY67kpyZ71RswrjIeEIj1aVu1ENeTa+Pj/mCLEW5dtJRiFH0fDijD/E/IJyKLlwsQI+o4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:28:58.275616Z"},"content_sha256":"e42d29ab5623bf98e9962f99c37bce4625941651253c29a16e923d22beb8e2e9","schema_version":"1.0","event_id":"sha256:e42d29ab5623bf98e9962f99c37bce4625941651253c29a16e923d22beb8e2e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C7J3OXCN54SOFRBYX5CBAIJFPD","target":"graph","payload":{"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"},"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-18T02:54:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1eeGEzbIOFeXVqolr5wag+Mq44m4b32nJy0zcEsrsPMPy2Y152jGaOYvbMpU0nfKfqWrOgGajia14nvsR0tDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:28:58.276237Z"},"content_sha256":"e1d0906452e8030fd5071877580388553547f78902a31fa803c523228b31924d","schema_version":"1.0","event_id":"sha256:e1d0906452e8030fd5071877580388553547f78902a31fa803c523228b31924d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/bundle.json","state_url":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/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-05-30T08:28:58Z","links":{"resolver":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD","bundle":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/bundle.json","state":"https://pith.science/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7J3OXCN54SOFRBYX5CBAIJFPD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C7J3OXCN54SOFRBYX5CBAIJFPD","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":"7f175afab68abbb29d69bddb5f624acc17e25cd8c2a51f061c3050ded796211c","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-30T17:46:54Z","title_canon_sha256":"c3f4bd397c9b8c3612031e21709995df7f305f904f79ffd42733b3feaf2ee48b"},"schema_version":"1.0","source":{"id":"1312.0132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0132","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0132v2","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0132","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"C7J3OXCN54SO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C7J3OXCN54SOFRBY","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C7J3OXCN","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e1d0906452e8030fd5071877580388553547f78902a31fa803c523228b31924d","target":"graph","created_at":"2026-05-18T02:54:21Z","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":"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","authors_text":"Amin Gohari, Amirbehshad Shahrasbi, Mehrdad Tahmasbi","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-30T17:46:54Z","title":"Critical Graphs in Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0132","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:e42d29ab5623bf98e9962f99c37bce4625941651253c29a16e923d22beb8e2e9","target":"record","created_at":"2026-05-18T02:54:21Z","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":"7f175afab68abbb29d69bddb5f624acc17e25cd8c2a51f061c3050ded796211c","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-30T17:46:54Z","title_canon_sha256":"c3f4bd397c9b8c3612031e21709995df7f305f904f79ffd42733b3feaf2ee48b"},"schema_version":"1.0","source":{"id":"1312.0132","kind":"arxiv","version":2}},"canonical_sha256":"17d3b75c4def24e2c438bf4410212578ef9df7e91deb5383b87997fd4fc2970c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17d3b75c4def24e2c438bf4410212578ef9df7e91deb5383b87997fd4fc2970c","first_computed_at":"2026-05-18T02:54:21.072772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:21.072772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+qF3Z9gNEQOvafktjRcT6Om+5eq2G+cIHOJcL1+IhzZ7EXBuF9uTAFZLSqQuq79kefj0b4U8If3GWVDeeL+wDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:21.073150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e42d29ab5623bf98e9962f99c37bce4625941651253c29a16e923d22beb8e2e9","sha256:e1d0906452e8030fd5071877580388553547f78902a31fa803c523228b31924d"],"state_sha256":"ab468a40d3b73eab4a43778e6a1ccb69073945af49b8fd9736fe93cc9796ba42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xnI4RSJtzxxvlleV+hHHQ2hNjQMLzzbZHFZWvZvzqIAq3lcxDYY/AhujcV5JZuwKOfGCewYYBrgZkjYd5uMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:28:58.280308Z","bundle_sha256":"2ab36c6367e88d1cdc721cd93345059e09a78a70841f5faabf9dbef96c2a9197"}}