{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FOETIBJEY25EMGFAMW7XAFZ6HL","short_pith_number":"pith:FOETIBJE","canonical_record":{"source":{"id":"1702.08741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-28T11:03:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bf1ce3ca8b119a9adb1b1dea7f1a2363d23e66ee146d7d5496ccf473fa5e9ec0","abstract_canon_sha256":"99cc11146f72a76e91459aaba89624e10608bec35835bd208c03a7ff3c4ea03a"},"schema_version":"1.0"},"canonical_sha256":"2b89340524c6ba4618a065bf70173e3ae9b330d544690aca63c1e130feeb66b3","source":{"kind":"arxiv","id":"1702.08741","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08741","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08741v2","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08741","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"FOETIBJEY25E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOETIBJEY25EMGFA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOETIBJE","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FOETIBJEY25EMGFAMW7XAFZ6HL","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-28T11:03:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bf1ce3ca8b119a9adb1b1dea7f1a2363d23e66ee146d7d5496ccf473fa5e9ec0","abstract_canon_sha256":"99cc11146f72a76e91459aaba89624e10608bec35835bd208c03a7ff3c4ea03a"},"schema_version":"1.0"},"canonical_sha256":"2b89340524c6ba4618a065bf70173e3ae9b330d544690aca63c1e130feeb66b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:08.605984Z","signature_b64":"4/Q3HvQ7Z5DSCOXdNhcaPgFxti1mj0gs5+gMOdNYvD4j1b3heWINc57Y8vXgiUn9yZuXemjsxPQh7k8/5TwvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b89340524c6ba4618a065bf70173e3ae9b330d544690aca63c1e130feeb66b3","last_reissued_at":"2026-05-18T00:43:08.605287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:08.605287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08741","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-18T00:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7uKgifmZ4p1Cn6jV/xTaWpnDWQu1L0i2KayDDGB2jSW3kF6ZB5wJtFYZr8C0PKvZKdUrm8AkHfknn8JnzGEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:07:36.855230Z"},"content_sha256":"d2b3331119e6758788a9e5ea63cdf36ee4b9186a5fbffee70480c9fea6c54af2","schema_version":"1.0","event_id":"sha256:d2b3331119e6758788a9e5ea63cdf36ee4b9186a5fbffee70480c9fea6c54af2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FOETIBJEY25EMGFAMW7XAFZ6HL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extension complexity of stable set polytopes of bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Manuel Aprile, Marco Macchia, Samuel Fiorini, Tony Huynh, Yuri Faenza","submitted_at":"2017-02-28T11:03:47Z","abstract_excerpt":"The extension complexity $\\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let $\\mathsf{STAB}(G)$ be the convex hull of the stable sets of $G$. It is easy to see that $n \\leqslant \\mathsf{xc} (\\mathsf{STAB}(G)) \\leqslant n+m$. We improve both of these bounds. For the upper bound, we show that $\\mathsf{xc} (\\mathsf{STAB}(G))$ is $O(\\frac{n^2}{\\log n})$, which is an improvement when $G$ has quadratically many edges. For the lower bound, we prove that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08741","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-18T00:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rniYtM2qYjurMgMKp9wB98G9WrTh1Npmu8QMtkllVUmXgoSPF9OYpShyIsJF1/8PSOGwmxlTXrYvQJoW+9P4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:07:36.855888Z"},"content_sha256":"bdbd0731c0be178d9643121bbcca0371307998504bb082e08550a048965531a6","schema_version":"1.0","event_id":"sha256:bdbd0731c0be178d9643121bbcca0371307998504bb082e08550a048965531a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOETIBJEY25EMGFAMW7XAFZ6HL/bundle.json","state_url":"https://pith.science/pith/FOETIBJEY25EMGFAMW7XAFZ6HL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOETIBJEY25EMGFAMW7XAFZ6HL/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-24T00:07:36Z","links":{"resolver":"https://pith.science/pith/FOETIBJEY25EMGFAMW7XAFZ6HL","bundle":"https://pith.science/pith/FOETIBJEY25EMGFAMW7XAFZ6HL/bundle.json","state":"https://pith.science/pith/FOETIBJEY25EMGFAMW7XAFZ6HL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOETIBJEY25EMGFAMW7XAFZ6HL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FOETIBJEY25EMGFAMW7XAFZ6HL","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":"99cc11146f72a76e91459aaba89624e10608bec35835bd208c03a7ff3c4ea03a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-28T11:03:47Z","title_canon_sha256":"bf1ce3ca8b119a9adb1b1dea7f1a2363d23e66ee146d7d5496ccf473fa5e9ec0"},"schema_version":"1.0","source":{"id":"1702.08741","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08741","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08741v2","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08741","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"FOETIBJEY25E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOETIBJEY25EMGFA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOETIBJE","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:bdbd0731c0be178d9643121bbcca0371307998504bb082e08550a048965531a6","target":"graph","created_at":"2026-05-18T00:43:08Z","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":"The extension complexity $\\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let $\\mathsf{STAB}(G)$ be the convex hull of the stable sets of $G$. It is easy to see that $n \\leqslant \\mathsf{xc} (\\mathsf{STAB}(G)) \\leqslant n+m$. We improve both of these bounds. For the upper bound, we show that $\\mathsf{xc} (\\mathsf{STAB}(G))$ is $O(\\frac{n^2}{\\log n})$, which is an improvement when $G$ has quadratically many edges. For the lower bound, we prove that ","authors_text":"Manuel Aprile, Marco Macchia, Samuel Fiorini, Tony Huynh, Yuri Faenza","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-28T11:03:47Z","title":"Extension complexity of stable set polytopes of bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08741","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:d2b3331119e6758788a9e5ea63cdf36ee4b9186a5fbffee70480c9fea6c54af2","target":"record","created_at":"2026-05-18T00:43:08Z","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":"99cc11146f72a76e91459aaba89624e10608bec35835bd208c03a7ff3c4ea03a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-28T11:03:47Z","title_canon_sha256":"bf1ce3ca8b119a9adb1b1dea7f1a2363d23e66ee146d7d5496ccf473fa5e9ec0"},"schema_version":"1.0","source":{"id":"1702.08741","kind":"arxiv","version":2}},"canonical_sha256":"2b89340524c6ba4618a065bf70173e3ae9b330d544690aca63c1e130feeb66b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b89340524c6ba4618a065bf70173e3ae9b330d544690aca63c1e130feeb66b3","first_computed_at":"2026-05-18T00:43:08.605287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:08.605287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4/Q3HvQ7Z5DSCOXdNhcaPgFxti1mj0gs5+gMOdNYvD4j1b3heWINc57Y8vXgiUn9yZuXemjsxPQh7k8/5TwvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:08.605984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08741","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2b3331119e6758788a9e5ea63cdf36ee4b9186a5fbffee70480c9fea6c54af2","sha256:bdbd0731c0be178d9643121bbcca0371307998504bb082e08550a048965531a6"],"state_sha256":"b6b77ed3b5b3c9cf5ce1601d50f557c25a625354c8c99cd4425878dc4fa4f9ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FMx2JWlgnqewSSXx2+VakrPerac+7aHeK4cRLFPPrrRseKDKkSbJ74PByQFDtXa5fKbwFE51uMFoOmmCdNOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:07:36.859301Z","bundle_sha256":"5096552ba2149c8fe28ef3e363df331b01cf8635799c9bc47502831c01186505"}}