{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3UBAYCKPEOSZITVBHDTOCXX7AI","short_pith_number":"pith:3UBAYCKP","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"},"canonical_sha256":"dd020c094f23a5944ea138e6e15eff0205e1897b20130cef4e4bcdfd4ccaf565","source":{"kind":"arxiv","id":"1108.2489","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2489","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2489v1","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2489","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"3UBAYCKPEOSZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3UBAYCKPEOSZITVB","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3UBAYCKP","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3UBAYCKPEOSZITVBHDTOCXX7AI","target":"record","payload":{"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"},"canonical_sha256":"dd020c094f23a5944ea138e6e15eff0205e1897b20130cef4e4bcdfd4ccaf565","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"},"source_kind":"arxiv","source_id":"1108.2489","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-18T04:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MR3+jzHM0hVAH45S0qVDGb9Vr3owCNV5J40pTnqFuJDn1j7E/mxCGnbMDT1l691elJLsKhNtwl8/zMUKHYFuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:51:09.466171Z"},"content_sha256":"2f98e6af7414d00bef93f859b01c66845a58b7b40406fae6eba501807de688af","schema_version":"1.0","event_id":"sha256:2f98e6af7414d00bef93f859b01c66845a58b7b40406fae6eba501807de688af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3UBAYCKPEOSZITVBHDTOCXX7AI","target":"graph","payload":{"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"},"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-18T04:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9qYz7CyDDVgCp7YT4i2FUF6jO8iAm+7V0Y+NuCai5wzpkYpindRKvxzK4pAl8zoGHK1dDs9IfyAUHQu/WzhRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:51:09.466542Z"},"content_sha256":"51877f6dd0a8dc2b7948d4011ffad713b29418246b688c31d90cb16b1e1e2421","schema_version":"1.0","event_id":"sha256:51877f6dd0a8dc2b7948d4011ffad713b29418246b688c31d90cb16b1e1e2421"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/bundle.json","state_url":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/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-30T04:51:09Z","links":{"resolver":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI","bundle":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/bundle.json","state":"https://pith.science/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UBAYCKPEOSZITVBHDTOCXX7AI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3UBAYCKPEOSZITVBHDTOCXX7AI","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":"4bcbcd1555583bc585ad816433e0d04f8fc2abfa799e67ea76b26e0554ae8ebb","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T19:09:09Z","title_canon_sha256":"c1f8d32d40144c320c184bcd24290a9133f44609a488bc66c5abe4c378134138"},"schema_version":"1.0","source":{"id":"1108.2489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2489","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2489v1","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2489","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"3UBAYCKPEOSZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3UBAYCKPEOSZITVB","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3UBAYCKP","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:51877f6dd0a8dc2b7948d4011ffad713b29418246b688c31d90cb16b1e1e2421","target":"graph","created_at":"2026-05-18T04:15:37Z","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":"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","authors_text":"Anna Blasiak, Eyal Lubetzky, Robert Kleinberg","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T19:09:09Z","title":"Lexicographic products and the power of non-linear network coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2489","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:2f98e6af7414d00bef93f859b01c66845a58b7b40406fae6eba501807de688af","target":"record","created_at":"2026-05-18T04:15:37Z","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":"4bcbcd1555583bc585ad816433e0d04f8fc2abfa799e67ea76b26e0554ae8ebb","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T19:09:09Z","title_canon_sha256":"c1f8d32d40144c320c184bcd24290a9133f44609a488bc66c5abe4c378134138"},"schema_version":"1.0","source":{"id":"1108.2489","kind":"arxiv","version":1}},"canonical_sha256":"dd020c094f23a5944ea138e6e15eff0205e1897b20130cef4e4bcdfd4ccaf565","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd020c094f23a5944ea138e6e15eff0205e1897b20130cef4e4bcdfd4ccaf565","first_computed_at":"2026-05-18T04:15:37.581892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:37.581892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eC5HX3DJA8qFEAlJSX8hATKqqGCihj/LWVd33XZkOkim6cBUBioJVYUoc65cnBJRjFnD8qtTsTFQ8lwBx25sCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:37.582808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f98e6af7414d00bef93f859b01c66845a58b7b40406fae6eba501807de688af","sha256:51877f6dd0a8dc2b7948d4011ffad713b29418246b688c31d90cb16b1e1e2421"],"state_sha256":"228307cb05358ecdb26c25f5d200146c02cf52ed3701be413d3b30c71192a4f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J20ervq+eDfQNytADE6+VYaSJEJQRU7Nsc1r+bIt2qPQjj8FZdn5+mIUKX84DInA5ihyn76aA4em272qgZkaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:51:09.468562Z","bundle_sha256":"5e54e7d2a408d7ce2ea57916017774a8995d0d84b4cd6e74ed5d7f1d2f5cbae1"}}