{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZRIJCNMNTRHLC3BEX2I5TVXCBC","short_pith_number":"pith:ZRIJCNMN","schema_version":"1.0","canonical_sha256":"cc5091358d9c4eb16c24be91d9d6e208b2fd1f4dbfc53cafd48f87579e01894b","source":{"kind":"arxiv","id":"1004.1379","version":2},"attestation_state":"computed","paper":{"title":"Index coding via linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Anna Blasiak, Eyal Lubetzky, Robert Kleinberg","submitted_at":"2010-04-08T17:33:06Z","abstract_excerpt":"Index Coding has received considerable attention recently motivated in part by real-world applications and in part by its connection to Network Coding. The basic setting of Index Coding encodes the problem input as an undirected graph and the fundamental parameter is the broadcast rate $\\beta$, the average communication cost per bit for sufficiently long messages (i.e. the non-linear vector capacity). Recent nontrivial bounds on $\\beta$ were derived from the study of other Index Coding capacities (e.g. the scalar capacity $\\beta_1$) by Bar-Yossef et al (2006), Lubetzky and Stav (2007) and Alon"},"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":"1004.1379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-08T17:33:06Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"bcf102ea011c084c3bbce3ff130c09c283c94031177ecff71afbf7aa25c91428","abstract_canon_sha256":"7f89de438ef4f84640bced67f1182e87a434da802d3c91ed6e966c6edc86805e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:23.538735Z","signature_b64":"/SzX2DEdIBJn5FyhBqkQ20bE9T0RGbjnZfRqA8IMelC4Sgqu1WDG1ZXi7TS4eADP7BUKBQwbdbUOfB1tevi+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc5091358d9c4eb16c24be91d9d6e208b2fd1f4dbfc53cafd48f87579e01894b","last_reissued_at":"2026-05-18T04:18:23.538224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:23.538224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Index coding via linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Anna Blasiak, Eyal Lubetzky, Robert Kleinberg","submitted_at":"2010-04-08T17:33:06Z","abstract_excerpt":"Index Coding has received considerable attention recently motivated in part by real-world applications and in part by its connection to Network Coding. The basic setting of Index Coding encodes the problem input as an undirected graph and the fundamental parameter is the broadcast rate $\\beta$, the average communication cost per bit for sufficiently long messages (i.e. the non-linear vector capacity). Recent nontrivial bounds on $\\beta$ were derived from the study of other Index Coding capacities (e.g. the scalar capacity $\\beta_1$) by Bar-Yossef et al (2006), Lubetzky and Stav (2007) and Alon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1379","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":"1004.1379","created_at":"2026-05-18T04:18:23.538303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.1379v2","created_at":"2026-05-18T04:18:23.538303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1379","created_at":"2026-05-18T04:18:23.538303+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRIJCNMNTRHL","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRIJCNMNTRHLC3BE","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRIJCNMN","created_at":"2026-05-18T12:26:18.847500+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/ZRIJCNMNTRHLC3BEX2I5TVXCBC","json":"https://pith.science/pith/ZRIJCNMNTRHLC3BEX2I5TVXCBC.json","graph_json":"https://pith.science/api/pith-number/ZRIJCNMNTRHLC3BEX2I5TVXCBC/graph.json","events_json":"https://pith.science/api/pith-number/ZRIJCNMNTRHLC3BEX2I5TVXCBC/events.json","paper":"https://pith.science/paper/ZRIJCNMN"},"agent_actions":{"view_html":"https://pith.science/pith/ZRIJCNMNTRHLC3BEX2I5TVXCBC","download_json":"https://pith.science/pith/ZRIJCNMNTRHLC3BEX2I5TVXCBC.json","view_paper":"https://pith.science/paper/ZRIJCNMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.1379&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRIJCNMNTRHLC3BEX2I5TVXCBC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRIJCNMNTRHLC3BEX2I5TVXCBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRIJCNMNTRHLC3BEX2I5TVXCBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRIJCNMNTRHLC3BEX2I5TVXCBC/action/storage_attestation","attest_author":"https://pith.science/pith/ZRIJCNMNTRHLC3BEX2I5TVXCBC/action/author_attestation","sign_citation":"https://pith.science/pith/ZRIJCNMNTRHLC3BEX2I5TVXCBC/action/citation_signature","submit_replication":"https://pith.science/pith/ZRIJCNMNTRHLC3BEX2I5TVXCBC/action/replication_record"}},"created_at":"2026-05-18T04:18:23.538303+00:00","updated_at":"2026-05-18T04:18:23.538303+00:00"}