{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KI4BJK7JGIO5NAHL5ZZEJN6JIR","short_pith_number":"pith:KI4BJK7J","canonical_record":{"source":{"id":"1511.08841","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-27T22:31:26Z","cross_cats_sorted":[],"title_canon_sha256":"263f26d40815b3c4db75be4094ccc6f2a500ed211ab78623fe21df0b9c4cd65d","abstract_canon_sha256":"b8c2eb545fcf9835b2600b9ef5283d5279049189f63a4e9fd49d30e7864c1a86"},"schema_version":"1.0"},"canonical_sha256":"523814abe9321dd680ebee7244b7c9445f531f1bb93f6e33111eb6334722369b","source":{"kind":"arxiv","id":"1511.08841","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08841","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08841v3","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08841","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"pith_short_12","alias_value":"KI4BJK7JGIO5","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KI4BJK7JGIO5NAHL","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KI4BJK7J","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KI4BJK7JGIO5NAHL5ZZEJN6JIR","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08841","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-27T22:31:26Z","cross_cats_sorted":[],"title_canon_sha256":"263f26d40815b3c4db75be4094ccc6f2a500ed211ab78623fe21df0b9c4cd65d","abstract_canon_sha256":"b8c2eb545fcf9835b2600b9ef5283d5279049189f63a4e9fd49d30e7864c1a86"},"schema_version":"1.0"},"canonical_sha256":"523814abe9321dd680ebee7244b7c9445f531f1bb93f6e33111eb6334722369b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:25.073335Z","signature_b64":"BHm0M8/SVctnv4aJsZOsTHcwuDncuhpNXAcj0bk9TZyvUGXJHvq7dn0QQsHZFKBVf9Vg+JgrGn1Kja+sWjoJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523814abe9321dd680ebee7244b7c9445f531f1bb93f6e33111eb6334722369b","last_reissued_at":"2026-05-18T00:49:25.072631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:25.072631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08841","source_version":3,"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:49:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1vTBvFgvzMaaXP18U1g7TxvqyET6SCXU8x1obJ94XKDGrtPmM0fGTUa6jh6bhVyLngmvTww/sou7gIAiz+NDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:59:12.609272Z"},"content_sha256":"75c77ee682f163e83364a11db60fc9238535f0467afdd08ab93f165756eee36c","schema_version":"1.0","event_id":"sha256:75c77ee682f163e83364a11db60fc9238535f0467afdd08ab93f165756eee36c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KI4BJK7JGIO5NAHL5ZZEJN6JIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Extension Complexity of Independent Set and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hans Raj Tiwary, Jakub Gajarsk\\'y, Petr Hlin\\v{e}n\\'y","submitted_at":"2015-11-27T22:31:26Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices and $\\mathrm{STAB}_k(G)$ be the convex hull of characteristic vectors of its independent sets of size at most $k$. We study extension complexity of $\\mathrm{STAB}_k(G)$ with respect to a fixed parameter $k$ (analogously to, e.g., parameterized computational complexity of problems). We show that for graphs $G$ from a class of bounded expansion it holds that $\\mathrm{xc}(\\mathrm{STAB}_k(G))\\leqslant \\mathcal{O}(f(k)\\cdot n)$ where the function $f$ depends only on the class. This result can be extended in a simple way to a wide range of similarly defined graph p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08841","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"},"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:49:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"neeva1yIy7mRkFfm+zFnUOMrq9EzfR8X23OmkP8176onGmyRAOFO1uOijuvNugHEOFxaJoduOA3z/r5x/VT4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:59:12.609629Z"},"content_sha256":"eadd4cfd1249be32edb4b6485464ca1bdeffba9d5b8a24d21a368983adda5176","schema_version":"1.0","event_id":"sha256:eadd4cfd1249be32edb4b6485464ca1bdeffba9d5b8a24d21a368983adda5176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KI4BJK7JGIO5NAHL5ZZEJN6JIR/bundle.json","state_url":"https://pith.science/pith/KI4BJK7JGIO5NAHL5ZZEJN6JIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KI4BJK7JGIO5NAHL5ZZEJN6JIR/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-06-04T13:59:12Z","links":{"resolver":"https://pith.science/pith/KI4BJK7JGIO5NAHL5ZZEJN6JIR","bundle":"https://pith.science/pith/KI4BJK7JGIO5NAHL5ZZEJN6JIR/bundle.json","state":"https://pith.science/pith/KI4BJK7JGIO5NAHL5ZZEJN6JIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KI4BJK7JGIO5NAHL5ZZEJN6JIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KI4BJK7JGIO5NAHL5ZZEJN6JIR","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":"b8c2eb545fcf9835b2600b9ef5283d5279049189f63a4e9fd49d30e7864c1a86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-27T22:31:26Z","title_canon_sha256":"263f26d40815b3c4db75be4094ccc6f2a500ed211ab78623fe21df0b9c4cd65d"},"schema_version":"1.0","source":{"id":"1511.08841","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08841","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08841v3","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08841","created_at":"2026-05-18T00:49:25Z"},{"alias_kind":"pith_short_12","alias_value":"KI4BJK7JGIO5","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KI4BJK7JGIO5NAHL","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KI4BJK7J","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:eadd4cfd1249be32edb4b6485464ca1bdeffba9d5b8a24d21a368983adda5176","target":"graph","created_at":"2026-05-18T00:49:25Z","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":"Let $G$ be a graph on $n$ vertices and $\\mathrm{STAB}_k(G)$ be the convex hull of characteristic vectors of its independent sets of size at most $k$. We study extension complexity of $\\mathrm{STAB}_k(G)$ with respect to a fixed parameter $k$ (analogously to, e.g., parameterized computational complexity of problems). We show that for graphs $G$ from a class of bounded expansion it holds that $\\mathrm{xc}(\\mathrm{STAB}_k(G))\\leqslant \\mathcal{O}(f(k)\\cdot n)$ where the function $f$ depends only on the class. This result can be extended in a simple way to a wide range of similarly defined graph p","authors_text":"Hans Raj Tiwary, Jakub Gajarsk\\'y, Petr Hlin\\v{e}n\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-27T22:31:26Z","title":"Parameterized Extension Complexity of Independent Set and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08841","kind":"arxiv","version":3},"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:75c77ee682f163e83364a11db60fc9238535f0467afdd08ab93f165756eee36c","target":"record","created_at":"2026-05-18T00:49:25Z","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":"b8c2eb545fcf9835b2600b9ef5283d5279049189f63a4e9fd49d30e7864c1a86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-27T22:31:26Z","title_canon_sha256":"263f26d40815b3c4db75be4094ccc6f2a500ed211ab78623fe21df0b9c4cd65d"},"schema_version":"1.0","source":{"id":"1511.08841","kind":"arxiv","version":3}},"canonical_sha256":"523814abe9321dd680ebee7244b7c9445f531f1bb93f6e33111eb6334722369b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"523814abe9321dd680ebee7244b7c9445f531f1bb93f6e33111eb6334722369b","first_computed_at":"2026-05-18T00:49:25.072631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:25.072631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BHm0M8/SVctnv4aJsZOsTHcwuDncuhpNXAcj0bk9TZyvUGXJHvq7dn0QQsHZFKBVf9Vg+JgrGn1Kja+sWjoJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:25.073335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08841","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75c77ee682f163e83364a11db60fc9238535f0467afdd08ab93f165756eee36c","sha256:eadd4cfd1249be32edb4b6485464ca1bdeffba9d5b8a24d21a368983adda5176"],"state_sha256":"5fc8649629acec1cf8cf68960a90aee81006ac993ae7381c1b3c7f387ad77a5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZpzPah9TH7Q3Y/bg/spbBKgTHrwWRhlZmWfLFQ5yNnlmxNyIsjAm9mxmOHK9mWSTA+tBXJsrO6k5nnZB0RSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:59:12.611547Z","bundle_sha256":"d656a0a8fe99c326e8b08befb35b7e57eeb0e7d3c0f17d51c765d97101d1d7ee"}}