{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BSEAG44FO633QWLSG2IIV5ZF3F","short_pith_number":"pith:BSEAG44F","schema_version":"1.0","canonical_sha256":"0c8803738577b7b8597236908af725d96e0a7805f276663a7bb021473e40e2f4","source":{"kind":"arxiv","id":"1105.4127","version":3},"attestation_state":"computed","paper":{"title":"Extended formulations, non-negative factorizations and randomized communication protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hans Raj Tiwary, Roland Grappe, Samuel Fiorini, Yuri Faenza","submitted_at":"2011-05-20T16:41:16Z","abstract_excerpt":"An extended formulation of a polyhedron $P$ is a linear description of a polyhedron $Q$ together with a linear map $\\pi$ such that $\\pi(Q)=P$. These objects are of fundamental importance in polyhedral combinatorics and optimization theory, and the subject of a number of studies. Yannakakis' factorization theorem [M. Yannakakis. Expressing combinatorial optimization problems by linear programs. {\\em J. Comput. System Sci.}, 43(3):441--466 (1991)] provides a surprising connection between extended formulations and communication complexity, showing that the smallest size of an extended formulation"},"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":"1105.4127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-20T16:41:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"97f9700f6b089c48a8d1e773a0db4ec9605d1f3fae7e416fb6446786003cce33","abstract_canon_sha256":"e736d79a084d76a76bb5e49089aeb2b9b211c56f01f7f9ebc80521bb9bb0ecfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:59.776741Z","signature_b64":"HOMPzmbqp9o8RLYL4jz4rohFk9wXVL7fUYYrU/Oez3jFWiGG01WOHF4JNEaPASXYaRGB4XqpdqppK4PLXWabDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8803738577b7b8597236908af725d96e0a7805f276663a7bb021473e40e2f4","last_reissued_at":"2026-05-18T03:25:59.776108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:59.776108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extended formulations, non-negative factorizations and randomized communication protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hans Raj Tiwary, Roland Grappe, Samuel Fiorini, Yuri Faenza","submitted_at":"2011-05-20T16:41:16Z","abstract_excerpt":"An extended formulation of a polyhedron $P$ is a linear description of a polyhedron $Q$ together with a linear map $\\pi$ such that $\\pi(Q)=P$. These objects are of fundamental importance in polyhedral combinatorics and optimization theory, and the subject of a number of studies. Yannakakis' factorization theorem [M. Yannakakis. Expressing combinatorial optimization problems by linear programs. {\\em J. Comput. System Sci.}, 43(3):441--466 (1991)] provides a surprising connection between extended formulations and communication complexity, showing that the smallest size of an extended formulation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4127","kind":"arxiv","version":3},"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":"1105.4127","created_at":"2026-05-18T03:25:59.776205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4127v3","created_at":"2026-05-18T03:25:59.776205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4127","created_at":"2026-05-18T03:25:59.776205+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSEAG44FO633","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSEAG44FO633QWLS","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSEAG44F","created_at":"2026-05-18T12:26:24.575870+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/BSEAG44FO633QWLSG2IIV5ZF3F","json":"https://pith.science/pith/BSEAG44FO633QWLSG2IIV5ZF3F.json","graph_json":"https://pith.science/api/pith-number/BSEAG44FO633QWLSG2IIV5ZF3F/graph.json","events_json":"https://pith.science/api/pith-number/BSEAG44FO633QWLSG2IIV5ZF3F/events.json","paper":"https://pith.science/paper/BSEAG44F"},"agent_actions":{"view_html":"https://pith.science/pith/BSEAG44FO633QWLSG2IIV5ZF3F","download_json":"https://pith.science/pith/BSEAG44FO633QWLSG2IIV5ZF3F.json","view_paper":"https://pith.science/paper/BSEAG44F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4127&json=true","fetch_graph":"https://pith.science/api/pith-number/BSEAG44FO633QWLSG2IIV5ZF3F/graph.json","fetch_events":"https://pith.science/api/pith-number/BSEAG44FO633QWLSG2IIV5ZF3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSEAG44FO633QWLSG2IIV5ZF3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSEAG44FO633QWLSG2IIV5ZF3F/action/storage_attestation","attest_author":"https://pith.science/pith/BSEAG44FO633QWLSG2IIV5ZF3F/action/author_attestation","sign_citation":"https://pith.science/pith/BSEAG44FO633QWLSG2IIV5ZF3F/action/citation_signature","submit_replication":"https://pith.science/pith/BSEAG44FO633QWLSG2IIV5ZF3F/action/replication_record"}},"created_at":"2026-05-18T03:25:59.776205+00:00","updated_at":"2026-05-18T03:25:59.776205+00:00"}