{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:H3PYSJZNM6P5HBUNVL5YNUWL3F","short_pith_number":"pith:H3PYSJZN","canonical_record":{"source":{"id":"1902.10271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T00:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"287b264d37f27c7565b6327abe0fe92018735d21700b7eef0894953e754cceaa","abstract_canon_sha256":"ad457789f9a9805f16825eb10fe2b0a2dfca3ba9a09319888e5a31e781ecc4f4"},"schema_version":"1.0"},"canonical_sha256":"3edf89272d679fd3868daafb86d2cbd9717e9e8391c24f2d36ceca699cab432f","source":{"kind":"arxiv","id":"1902.10271","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10271","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10271v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10271","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"H3PYSJZNM6P5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"H3PYSJZNM6P5HBUN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"H3PYSJZN","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:H3PYSJZNM6P5HBUNVL5YNUWL3F","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T00:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"287b264d37f27c7565b6327abe0fe92018735d21700b7eef0894953e754cceaa","abstract_canon_sha256":"ad457789f9a9805f16825eb10fe2b0a2dfca3ba9a09319888e5a31e781ecc4f4"},"schema_version":"1.0"},"canonical_sha256":"3edf89272d679fd3868daafb86d2cbd9717e9e8391c24f2d36ceca699cab432f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.329475Z","signature_b64":"XZcjS46sbEBlKd1cXdjPYNOkZPGgW3GvA0OPZ+BnycXirjOLbkSK6iN8PIoSfbaaGyEk62Quk8GWGWuEI6/rAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3edf89272d679fd3868daafb86d2cbd9717e9e8391c24f2d36ceca699cab432f","last_reissued_at":"2026-05-17T23:52:31.329072Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.329072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10271","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+BcpgAXXqCOu7qqHMrOXVFR0g1mAteghzS81RfzUazW6Ht5fGA5VMuCZUMsLs0d8uA/+PHy73bionoAUiJmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:39:46.453541Z"},"content_sha256":"45e0442bb738de6f37039693fac37f50591b380b9d5edc0af51e1eb137fd24f1","schema_version":"1.0","event_id":"sha256:45e0442bb738de6f37039693fac37f50591b380b9d5edc0af51e1eb137fd24f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:H3PYSJZNM6P5HBUNVL5YNUWL3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the extension complexity of scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Hans Raj Tiwary, Victor Verdugo","submitted_at":"2019-02-27T00:14:59Z","abstract_excerpt":"Linear programming is a powerful method in combinatorial optimization with many applications in theory and practice. For solving a linear program quickly it is desirable to have a formulation of small size for the given problem. A useful approach for this is the construction of an extended formulation, which is a linear program in a higher dimensional space whose projection yields the original linear program. For many problems it is known that a small extended formulation cannot exist. However, most of these problems are either $\\mathsf{NP}$-hard (like TSP), or only quite complicated polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10271","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FsAaAgdSiSIyvDkEptnZo66iS8QpHpes88Z3wj9sI3AACucwgpvRbUCOspljX3b/pwCzXkWnRxJrg99Xm7YJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:39:46.454304Z"},"content_sha256":"fefde7795e752340aad5b601fd3704297dd20d00aefee8fdfd9d5d7f803042ad","schema_version":"1.0","event_id":"sha256:fefde7795e752340aad5b601fd3704297dd20d00aefee8fdfd9d5d7f803042ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3PYSJZNM6P5HBUNVL5YNUWL3F/bundle.json","state_url":"https://pith.science/pith/H3PYSJZNM6P5HBUNVL5YNUWL3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3PYSJZNM6P5HBUNVL5YNUWL3F/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-01T01:39:46Z","links":{"resolver":"https://pith.science/pith/H3PYSJZNM6P5HBUNVL5YNUWL3F","bundle":"https://pith.science/pith/H3PYSJZNM6P5HBUNVL5YNUWL3F/bundle.json","state":"https://pith.science/pith/H3PYSJZNM6P5HBUNVL5YNUWL3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3PYSJZNM6P5HBUNVL5YNUWL3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:H3PYSJZNM6P5HBUNVL5YNUWL3F","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":"ad457789f9a9805f16825eb10fe2b0a2dfca3ba9a09319888e5a31e781ecc4f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T00:14:59Z","title_canon_sha256":"287b264d37f27c7565b6327abe0fe92018735d21700b7eef0894953e754cceaa"},"schema_version":"1.0","source":{"id":"1902.10271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10271","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10271v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10271","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"H3PYSJZNM6P5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"H3PYSJZNM6P5HBUN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"H3PYSJZN","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:fefde7795e752340aad5b601fd3704297dd20d00aefee8fdfd9d5d7f803042ad","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"Linear programming is a powerful method in combinatorial optimization with many applications in theory and practice. For solving a linear program quickly it is desirable to have a formulation of small size for the given problem. A useful approach for this is the construction of an extended formulation, which is a linear program in a higher dimensional space whose projection yields the original linear program. For many problems it is known that a small extended formulation cannot exist. However, most of these problems are either $\\mathsf{NP}$-hard (like TSP), or only quite complicated polynomia","authors_text":"Andreas Wiese, Hans Raj Tiwary, Victor Verdugo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T00:14:59Z","title":"On the extension complexity of scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10271","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:45e0442bb738de6f37039693fac37f50591b380b9d5edc0af51e1eb137fd24f1","target":"record","created_at":"2026-05-17T23:52:31Z","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":"ad457789f9a9805f16825eb10fe2b0a2dfca3ba9a09319888e5a31e781ecc4f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T00:14:59Z","title_canon_sha256":"287b264d37f27c7565b6327abe0fe92018735d21700b7eef0894953e754cceaa"},"schema_version":"1.0","source":{"id":"1902.10271","kind":"arxiv","version":1}},"canonical_sha256":"3edf89272d679fd3868daafb86d2cbd9717e9e8391c24f2d36ceca699cab432f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3edf89272d679fd3868daafb86d2cbd9717e9e8391c24f2d36ceca699cab432f","first_computed_at":"2026-05-17T23:52:31.329072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.329072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XZcjS46sbEBlKd1cXdjPYNOkZPGgW3GvA0OPZ+BnycXirjOLbkSK6iN8PIoSfbaaGyEk62Quk8GWGWuEI6/rAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.329475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10271","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45e0442bb738de6f37039693fac37f50591b380b9d5edc0af51e1eb137fd24f1","sha256:fefde7795e752340aad5b601fd3704297dd20d00aefee8fdfd9d5d7f803042ad"],"state_sha256":"c23e75697580aa498188c7a40cf3ffd0bf4f503d87a6bf647972684ab0128f59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dt8K7wtPZ2Tjick3XMkTRhCjLclX996tLxpzbE4RO9oe0vtF1/ITCPS0N6AbPFw+e+7oysPp3+FqdTsd7xORBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:39:46.459201Z","bundle_sha256":"ab81294d2a5c8bbad6e52b14cd1c61fe0afe8c0892ffdeef6704e6af9ef80379"}}