{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FK7GCAF2RJ2BHGKPK3TRR2MHND","short_pith_number":"pith:FK7GCAF2","canonical_record":{"source":{"id":"1307.2295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T22:55:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb344f5563da91e8e8b81a586bba0ff95b04370c76ff0074ae62f8d0b98a03e0","abstract_canon_sha256":"bee432d2e45835b97e725ddb0214cf349a2becf746d618b2b7380028f750c5ff"},"schema_version":"1.0"},"canonical_sha256":"2abe6100ba8a7413994f56e718e98768e9e5d058973e016466cd71e966093bee","source":{"kind":"arxiv","id":"1307.2295","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2295","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2295v2","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2295","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"FK7GCAF2RJ2B","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FK7GCAF2RJ2BHGKP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FK7GCAF2","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FK7GCAF2RJ2BHGKPK3TRR2MHND","target":"record","payload":{"canonical_record":{"source":{"id":"1307.2295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T22:55:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb344f5563da91e8e8b81a586bba0ff95b04370c76ff0074ae62f8d0b98a03e0","abstract_canon_sha256":"bee432d2e45835b97e725ddb0214cf349a2becf746d618b2b7380028f750c5ff"},"schema_version":"1.0"},"canonical_sha256":"2abe6100ba8a7413994f56e718e98768e9e5d058973e016466cd71e966093bee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:20.437776Z","signature_b64":"rPutaSQPQrAZeSNSfKYxBdePtEcHkVU+WMQNt2356NcIdJRRhT6yBzKMFD/ue5KjvJPrnpTAqXapPBJf3bRLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2abe6100ba8a7413994f56e718e98768e9e5d058973e016466cd71e966093bee","last_reissued_at":"2026-05-18T03:15:20.437105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:20.437105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.2295","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-18T03:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rm2ZoTzPIDKsSX5bVk9tq7rwxRTTVnjBws3BCT6jm7DKlCMd9BrJTRIfxS5DdSZRWw0SQax04vMK5IPhRJJZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:58:44.978530Z"},"content_sha256":"671a1ad5aaa39c37c56d7a857b928c6b32b51ba6fba04214cad191e7d5893f9b","schema_version":"1.0","event_id":"sha256:671a1ad5aaa39c37c56d7a857b928c6b32b51ba6fba04214cad191e7d5893f9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FK7GCAF2RJ2BHGKPK3TRR2MHND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Duality Codes and the Integrality Gap Bound for Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Yu, Michael J. Neely","submitted_at":"2013-07-08T22:55:52Z","abstract_excerpt":"This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side information, and requests another subset of the packets. This problem is known as the index coding problem and can be represented by a bipartite digraph. An integer linear program is developed that provides a lower bound on the minimum number of transmissions required for any coding algorithm. Conversely, its linear programming relaxation is shown to provide an upper b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2295","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-18T03:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMhfSTfVIeIbNjjPkZ+rGnyBTllLWdjUM9s5v2XMQXno3PXXN8D2Et/+wLzHkK1osOgLjLGRb3H6GkXcq74xCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:58:44.978881Z"},"content_sha256":"c737088fa7418497f9dfe6f53e1b2c73dd971653c72a6cec9e4c47eacd200e47","schema_version":"1.0","event_id":"sha256:c737088fa7418497f9dfe6f53e1b2c73dd971653c72a6cec9e4c47eacd200e47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FK7GCAF2RJ2BHGKPK3TRR2MHND/bundle.json","state_url":"https://pith.science/pith/FK7GCAF2RJ2BHGKPK3TRR2MHND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FK7GCAF2RJ2BHGKPK3TRR2MHND/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-30T10:58:44Z","links":{"resolver":"https://pith.science/pith/FK7GCAF2RJ2BHGKPK3TRR2MHND","bundle":"https://pith.science/pith/FK7GCAF2RJ2BHGKPK3TRR2MHND/bundle.json","state":"https://pith.science/pith/FK7GCAF2RJ2BHGKPK3TRR2MHND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FK7GCAF2RJ2BHGKPK3TRR2MHND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FK7GCAF2RJ2BHGKPK3TRR2MHND","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":"bee432d2e45835b97e725ddb0214cf349a2becf746d618b2b7380028f750c5ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T22:55:52Z","title_canon_sha256":"bb344f5563da91e8e8b81a586bba0ff95b04370c76ff0074ae62f8d0b98a03e0"},"schema_version":"1.0","source":{"id":"1307.2295","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2295","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2295v2","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2295","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"FK7GCAF2RJ2B","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FK7GCAF2RJ2BHGKP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FK7GCAF2","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:c737088fa7418497f9dfe6f53e1b2c73dd971653c72a6cec9e4c47eacd200e47","target":"graph","created_at":"2026-05-18T03:15:20Z","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":"This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side information, and requests another subset of the packets. This problem is known as the index coding problem and can be represented by a bipartite digraph. An integer linear program is developed that provides a lower bound on the minimum number of transmissions required for any coding algorithm. Conversely, its linear programming relaxation is shown to provide an upper b","authors_text":"Hao Yu, Michael J. Neely","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T22:55:52Z","title":"Duality Codes and the Integrality Gap Bound for Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2295","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:671a1ad5aaa39c37c56d7a857b928c6b32b51ba6fba04214cad191e7d5893f9b","target":"record","created_at":"2026-05-18T03:15:20Z","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":"bee432d2e45835b97e725ddb0214cf349a2becf746d618b2b7380028f750c5ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T22:55:52Z","title_canon_sha256":"bb344f5563da91e8e8b81a586bba0ff95b04370c76ff0074ae62f8d0b98a03e0"},"schema_version":"1.0","source":{"id":"1307.2295","kind":"arxiv","version":2}},"canonical_sha256":"2abe6100ba8a7413994f56e718e98768e9e5d058973e016466cd71e966093bee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2abe6100ba8a7413994f56e718e98768e9e5d058973e016466cd71e966093bee","first_computed_at":"2026-05-18T03:15:20.437105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:20.437105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rPutaSQPQrAZeSNSfKYxBdePtEcHkVU+WMQNt2356NcIdJRRhT6yBzKMFD/ue5KjvJPrnpTAqXapPBJf3bRLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:20.437776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2295","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:671a1ad5aaa39c37c56d7a857b928c6b32b51ba6fba04214cad191e7d5893f9b","sha256:c737088fa7418497f9dfe6f53e1b2c73dd971653c72a6cec9e4c47eacd200e47"],"state_sha256":"b1ed9623af8283cff8445208f4d72ef3a796840adb66d413f424b4f06a39c840"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0yVJOEH29XUqdpEGnWkB17aF4JZ0Fu7oj5Gq3zfea0rkm2XTdVv8wNzzukxGdjpOwau+Otlp6YCVgwoYjVsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:58:44.981047Z","bundle_sha256":"9ef85a3e0dc9ea5c79affaf112b3148c712d15478bf46b1a480f33dba042abed"}}