{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ELSU4HWRMPYPHHN36UHFWFY46E","short_pith_number":"pith:ELSU4HWR","canonical_record":{"source":{"id":"1410.7082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-26T20:55:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4096ca54c759ee2caf75527ced9ff70bca8818f7347b4b53e107349bf057d7bf","abstract_canon_sha256":"cddd9c0567ad5f432b8f7148a92451028f4f24472ecc30493c98c2634735e738"},"schema_version":"1.0"},"canonical_sha256":"22e54e1ed163f0f39dbbf50e5b171cf13438c30553b4e9b7d078582509ef5fff","source":{"kind":"arxiv","id":"1410.7082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7082","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7082v1","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7082","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"ELSU4HWRMPYP","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ELSU4HWRMPYPHHN3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ELSU4HWR","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ELSU4HWRMPYPHHN36UHFWFY46E","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-26T20:55:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4096ca54c759ee2caf75527ced9ff70bca8818f7347b4b53e107349bf057d7bf","abstract_canon_sha256":"cddd9c0567ad5f432b8f7148a92451028f4f24472ecc30493c98c2634735e738"},"schema_version":"1.0"},"canonical_sha256":"22e54e1ed163f0f39dbbf50e5b171cf13438c30553b4e9b7d078582509ef5fff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:27.239433Z","signature_b64":"DIxLPtCYmPDJIWFfaleZQF076iqSBD+ezDPru67Icw6M9xQ78xhXobyq0keKvKH1sEiX610Xa6aZDmWJxZn+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22e54e1ed163f0f39dbbf50e5b171cf13438c30553b4e9b7d078582509ef5fff","last_reissued_at":"2026-05-18T00:18:27.238953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:27.238953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7082","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-18T00:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Hl27pkzDqBnDaJAVIPxsg5sQJYzvkFHeWwwt+3NuyVRKrhEFEqbuVnlrjwS6AMoH+wjhRr/FbflwibctOKtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:08:18.367441Z"},"content_sha256":"3830c41c0ff17da659682eab530c3dad3b8af5a5ca930bafb3cdcb5e6e795f1c","schema_version":"1.0","event_id":"sha256:3830c41c0ff17da659682eab530c3dad3b8af5a5ca930bafb3cdcb5e6e795f1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ELSU4HWRMPYPHHN36UHFWFY46E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of LP in Terms of the Face Lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Aleksandr Maksimenko","submitted_at":"2014-10-26T20:55:24Z","abstract_excerpt":"Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\\max\\limits_{x \\in P} f(x)$, where polytope $P$ is a convex hull of $X$. The key parameters for evaluating the complexity of a problem $X$ are the dimension $d$, the cardinality $|X|$, and the encoding size $S(X) = \\log_2 \\left(\\max\\limits_{x\\in X} \\|x\\|_{\\infty}\\right)$. We show that if the (time and space) complexity of some algorithm $A$ for solving a problem $X$ is defined "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7082","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-18T00:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzRIjemL0used42J7sTjibDYO3+TedXepeKOph4ALzN0wMSyPJI8czdQ9Ynac33brRhfrXNjSv5T4qwbknupBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:08:18.367792Z"},"content_sha256":"f19b6fa82e12260186471f3bfccba0f588e59785f61600eec7ef01c159ebd2ec","schema_version":"1.0","event_id":"sha256:f19b6fa82e12260186471f3bfccba0f588e59785f61600eec7ef01c159ebd2ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELSU4HWRMPYPHHN36UHFWFY46E/bundle.json","state_url":"https://pith.science/pith/ELSU4HWRMPYPHHN36UHFWFY46E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELSU4HWRMPYPHHN36UHFWFY46E/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-28T10:08:18Z","links":{"resolver":"https://pith.science/pith/ELSU4HWRMPYPHHN36UHFWFY46E","bundle":"https://pith.science/pith/ELSU4HWRMPYPHHN36UHFWFY46E/bundle.json","state":"https://pith.science/pith/ELSU4HWRMPYPHHN36UHFWFY46E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELSU4HWRMPYPHHN36UHFWFY46E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ELSU4HWRMPYPHHN36UHFWFY46E","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":"cddd9c0567ad5f432b8f7148a92451028f4f24472ecc30493c98c2634735e738","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-26T20:55:24Z","title_canon_sha256":"4096ca54c759ee2caf75527ced9ff70bca8818f7347b4b53e107349bf057d7bf"},"schema_version":"1.0","source":{"id":"1410.7082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7082","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7082v1","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7082","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"ELSU4HWRMPYP","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ELSU4HWRMPYPHHN3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ELSU4HWR","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:f19b6fa82e12260186471f3bfccba0f588e59785f61600eec7ef01c159ebd2ec","target":"graph","created_at":"2026-05-18T00:18:27Z","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 $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\\max\\limits_{x \\in P} f(x)$, where polytope $P$ is a convex hull of $X$. The key parameters for evaluating the complexity of a problem $X$ are the dimension $d$, the cardinality $|X|$, and the encoding size $S(X) = \\log_2 \\left(\\max\\limits_{x\\in X} \\|x\\|_{\\infty}\\right)$. We show that if the (time and space) complexity of some algorithm $A$ for solving a problem $X$ is defined ","authors_text":"Aleksandr Maksimenko","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-26T20:55:24Z","title":"Complexity of LP in Terms of the Face Lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7082","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:3830c41c0ff17da659682eab530c3dad3b8af5a5ca930bafb3cdcb5e6e795f1c","target":"record","created_at":"2026-05-18T00:18:27Z","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":"cddd9c0567ad5f432b8f7148a92451028f4f24472ecc30493c98c2634735e738","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-26T20:55:24Z","title_canon_sha256":"4096ca54c759ee2caf75527ced9ff70bca8818f7347b4b53e107349bf057d7bf"},"schema_version":"1.0","source":{"id":"1410.7082","kind":"arxiv","version":1}},"canonical_sha256":"22e54e1ed163f0f39dbbf50e5b171cf13438c30553b4e9b7d078582509ef5fff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22e54e1ed163f0f39dbbf50e5b171cf13438c30553b4e9b7d078582509ef5fff","first_computed_at":"2026-05-18T00:18:27.238953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:27.238953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DIxLPtCYmPDJIWFfaleZQF076iqSBD+ezDPru67Icw6M9xQ78xhXobyq0keKvKH1sEiX610Xa6aZDmWJxZn+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:27.239433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3830c41c0ff17da659682eab530c3dad3b8af5a5ca930bafb3cdcb5e6e795f1c","sha256:f19b6fa82e12260186471f3bfccba0f588e59785f61600eec7ef01c159ebd2ec"],"state_sha256":"28f3d23864e6e1f5b43b52ae232ec7063096dda7fefca4ad17cf54009754f740"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWbNUwr+F9y14mmsBeZEiPXKcYD75wg7nl/FuWbhRZz1JbaDqDtsEoSkdHeGWofSsSRo/e2fXCeLBB2y5NKwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:08:18.369925Z","bundle_sha256":"1a58f84d3c6187c5295a13ec93260059e3806d34174be7b8b0ccf5d316a3aa83"}}