{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J2IGHX6ZQW2HIRBBHVGE7MKHKC","short_pith_number":"pith:J2IGHX6Z","canonical_record":{"source":{"id":"1602.02422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T20:46:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cfb39b7da2bd0a9cbfdc4a45faac8dc0fc21637c22e755251a82705602916e16","abstract_canon_sha256":"2149d42b573ee7a93ec9778a6499abd039dfed937752bdbeb856436b16c3cc30"},"schema_version":"1.0"},"canonical_sha256":"4e9063dfd985b47444213d4c4fb14750b9807d7571bc4b0feb49b95840f5800a","source":{"kind":"arxiv","id":"1602.02422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02422","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02422v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02422","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"J2IGHX6ZQW2H","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2IGHX6ZQW2HIRBB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2IGHX6Z","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J2IGHX6ZQW2HIRBBHVGE7MKHKC","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T20:46:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cfb39b7da2bd0a9cbfdc4a45faac8dc0fc21637c22e755251a82705602916e16","abstract_canon_sha256":"2149d42b573ee7a93ec9778a6499abd039dfed937752bdbeb856436b16c3cc30"},"schema_version":"1.0"},"canonical_sha256":"4e9063dfd985b47444213d4c4fb14750b9807d7571bc4b0feb49b95840f5800a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:10.015444Z","signature_b64":"HyeBllRn8Wz9AVNt6xLtsC9+pGn/CumiGTdMUXFLg2AVyBfTVbDWaE5guUmfPaR2ORStjVMewq1pzAk5CHxyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e9063dfd985b47444213d4c4fb14750b9807d7571bc4b0feb49b95840f5800a","last_reissued_at":"2026-05-18T01:21:10.014753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:10.014753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02422","source_version":1,"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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofXOtdpiJYpWjzdentLnklOdgHD+qTyqtJcgDi56m1DC9/onJnk044bOQrBeMB3y5HLChHG7y85dLqcJ6lz5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:49:57.004506Z"},"content_sha256":"b85c8a6d7ea8041ece52220637f3ee54e3a86287545dc8def81a764417032f23","schema_version":"1.0","event_id":"sha256:b85c8a6d7ea8041ece52220637f3ee54e3a86287545dc8def81a764417032f23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J2IGHX6ZQW2HIRBBHVGE7MKHKC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Capacity of Index Coding for Some Classes of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fatemeh Arbabjolfaei, Young-Han Kim","submitted_at":"2016-02-07T20:46:28Z","abstract_excerpt":"For a class of graphs for which the Ramsey number $R(i,j)$ is upper bounded by $ci^aj^b$, for some constants $a,b,$ and $c$, it is shown that the clique covering scheme approximates the broadcast rate of every $n$-node index coding problem in the class within a multiplicative factor of $c^{\\frac{1}{a+b+1}} n^{\\frac{a+b}{a+b+1}}$ for every $n$. Using this theorem and some graph theoretic arguments, it is demonstrated that the broadcast rate of planar graphs, line graphs and fuzzy circular interval graphs is approximated by the clique covering scheme within a factor of $n^{\\frac{2}{3}}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02422","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"},"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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WK7RXvYhyIUkT0RylXH25hMGhJ9CEdzQCVGS+1ne0lCoLsGRQdLWk92i3UxEtiNlkh/Alvt73tNYT7dE/W/PBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:49:57.004861Z"},"content_sha256":"f0e788a38dbf3201583cb60ac5174eb62079528d9b4af0d8a8e66700847f2347","schema_version":"1.0","event_id":"sha256:f0e788a38dbf3201583cb60ac5174eb62079528d9b4af0d8a8e66700847f2347"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2IGHX6ZQW2HIRBBHVGE7MKHKC/bundle.json","state_url":"https://pith.science/pith/J2IGHX6ZQW2HIRBBHVGE7MKHKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2IGHX6ZQW2HIRBBHVGE7MKHKC/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-06-03T04:49:57Z","links":{"resolver":"https://pith.science/pith/J2IGHX6ZQW2HIRBBHVGE7MKHKC","bundle":"https://pith.science/pith/J2IGHX6ZQW2HIRBBHVGE7MKHKC/bundle.json","state":"https://pith.science/pith/J2IGHX6ZQW2HIRBBHVGE7MKHKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2IGHX6ZQW2HIRBBHVGE7MKHKC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J2IGHX6ZQW2HIRBBHVGE7MKHKC","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":"2149d42b573ee7a93ec9778a6499abd039dfed937752bdbeb856436b16c3cc30","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T20:46:28Z","title_canon_sha256":"cfb39b7da2bd0a9cbfdc4a45faac8dc0fc21637c22e755251a82705602916e16"},"schema_version":"1.0","source":{"id":"1602.02422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02422","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02422v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02422","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"J2IGHX6ZQW2H","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2IGHX6ZQW2HIRBB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2IGHX6Z","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:f0e788a38dbf3201583cb60ac5174eb62079528d9b4af0d8a8e66700847f2347","target":"graph","created_at":"2026-05-18T01:21:10Z","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":"For a class of graphs for which the Ramsey number $R(i,j)$ is upper bounded by $ci^aj^b$, for some constants $a,b,$ and $c$, it is shown that the clique covering scheme approximates the broadcast rate of every $n$-node index coding problem in the class within a multiplicative factor of $c^{\\frac{1}{a+b+1}} n^{\\frac{a+b}{a+b+1}}$ for every $n$. Using this theorem and some graph theoretic arguments, it is demonstrated that the broadcast rate of planar graphs, line graphs and fuzzy circular interval graphs is approximated by the clique covering scheme within a factor of $n^{\\frac{2}{3}}$.","authors_text":"Fatemeh Arbabjolfaei, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T20:46:28Z","title":"Approximate Capacity of Index Coding for Some Classes of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02422","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:b85c8a6d7ea8041ece52220637f3ee54e3a86287545dc8def81a764417032f23","target":"record","created_at":"2026-05-18T01:21:10Z","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":"2149d42b573ee7a93ec9778a6499abd039dfed937752bdbeb856436b16c3cc30","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T20:46:28Z","title_canon_sha256":"cfb39b7da2bd0a9cbfdc4a45faac8dc0fc21637c22e755251a82705602916e16"},"schema_version":"1.0","source":{"id":"1602.02422","kind":"arxiv","version":1}},"canonical_sha256":"4e9063dfd985b47444213d4c4fb14750b9807d7571bc4b0feb49b95840f5800a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e9063dfd985b47444213d4c4fb14750b9807d7571bc4b0feb49b95840f5800a","first_computed_at":"2026-05-18T01:21:10.014753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:10.014753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HyeBllRn8Wz9AVNt6xLtsC9+pGn/CumiGTdMUXFLg2AVyBfTVbDWaE5guUmfPaR2ORStjVMewq1pzAk5CHxyAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:10.015444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b85c8a6d7ea8041ece52220637f3ee54e3a86287545dc8def81a764417032f23","sha256:f0e788a38dbf3201583cb60ac5174eb62079528d9b4af0d8a8e66700847f2347"],"state_sha256":"3dc676a21f44c3c9dce6c0b70342326eef03c4f0bd71db08bcb7038b49114200"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ed3yXIyfU8KSoBiXIbwGVe6eClwPiLmbsJjrLYT9a2qxOHKCOEW/yELdtOaiXAFV2okBP9DqS/csom3aH4j4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:49:57.007037Z","bundle_sha256":"89c3d82b9f1863c893b8206230c99b202dd253a412de4eba9aac40375b23378a"}}