{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3UBAYCKPEOSZITVBHDTOCXX7AI","short_pith_number":"pith:3UBAYCKP","schema_version":"1.0","canonical_sha256":"dd020c094f23a5944ea138e6e15eff0205e1897b20130cef4e4bcdfd4ccaf565","source":{"kind":"arxiv","id":"1108.2489","version":1},"attestation_state":"computed","paper":{"title":"Lexicographic products and the power of non-linear network coding","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":"2011-08-11T19:09:09Z","abstract_excerpt":"We introduce a technique for establishing and amplifying gaps between parameters of network coding and index coding. The technique uses linear programs to establish separations between combinatorial and coding-theoretic parameters and applies hypergraph lexicographic products to amplify these separations. This entails combining the dual solutions of the lexicographic multiplicands and proving that they are a valid dual of the product. Our result is general enough to apply to a large family of linear programs. This blend of linear programs and lexicographic products gives a recipe for construct"},"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":"1108.2489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T19:09:09Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"c1f8d32d40144c320c184bcd24290a9133f44609a488bc66c5abe4c378134138","abstract_canon_sha256":"4bcbcd1555583bc585ad816433e0d04f8fc2abfa799e67ea76b26e0554ae8ebb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:37.582808Z","signature_b64":"eC5HX3DJA8qFEAlJSX8hATKqqGCihj/LWVd33XZkOkim6cBUBioJVYUoc65cnBJRjFnD8qtTsTFQ8lwBx25sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd020c094f23a5944ea138e6e15eff0205e1897b20130cef4e4bcdfd4ccaf565","last_reissued_at":"2026-05-18T04:15:37.581892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:37.581892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lexicographic products and the power of non-linear network coding","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":"2011-08-11T19:09:09Z","abstract_excerpt":"We introduce a technique for establishing and amplifying gaps between parameters of network coding and index coding. The technique uses linear programs to establish separations between combinatorial and coding-theoretic parameters and applies hypergraph lexicographic products to amplify these separations. This entails combining the dual solutions of the lexicographic multiplicands and proving that they are a valid dual of the product. Our result is general enough to apply to a large family of linear programs. This blend of linear programs and lexicographic products gives a recipe for construct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2489","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.2489","created_at":"2026-05-18T04:15:37.582031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2489v1","created_at":"2026-05-18T04:15:37.582031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2489","created_at":"2026-05-18T04:15:37.582031+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UBAYCKPEOSZ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UBAYCKPEOSZITVB","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UBAYCKP","created_at":"2026-05-18T12:26:20.644004+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/3UBAYCKPEOSZITVBHDTOCXX7AI","json":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI.json","graph_json":"https://pith.science/api/pith-number/3UBAYCKPEOSZITVBHDTOCXX7AI/graph.json","events_json":"https://pith.science/api/pith-number/3UBAYCKPEOSZITVBHDTOCXX7AI/events.json","paper":"https://pith.science/paper/3UBAYCKP"},"agent_actions":{"view_html":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI","download_json":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI.json","view_paper":"https://pith.science/paper/3UBAYCKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2489&json=true","fetch_graph":"https://pith.science/api/pith-number/3UBAYCKPEOSZITVBHDTOCXX7AI/graph.json","fetch_events":"https://pith.science/api/pith-number/3UBAYCKPEOSZITVBHDTOCXX7AI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/action/storage_attestation","attest_author":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/action/author_attestation","sign_citation":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/action/citation_signature","submit_replication":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/action/replication_record"}},"created_at":"2026-05-18T04:15:37.582031+00:00","updated_at":"2026-05-18T04:15:37.582031+00:00"}