{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XZ6M6LPI4VI4I7BDMLUUWGVOYI","short_pith_number":"pith:XZ6M6LPI","canonical_record":{"source":{"id":"1304.1247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T05:32:33Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"14c32c8575f8bb7cce681c0315324cbc568408c6f81c155717889296dc221406","abstract_canon_sha256":"78eba1f421f9238f5b58656f200a5262029d0977d5a9d1a6f7ff541f389e5b08"},"schema_version":"1.0"},"canonical_sha256":"be7ccf2de8e551c47c2362e94b1aaec22d9d13db5299a6568f93786f7f1c3176","source":{"kind":"arxiv","id":"1304.1247","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1247","created_at":"2026-05-18T03:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1247v2","created_at":"2026-05-18T03:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1247","created_at":"2026-05-18T03:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"XZ6M6LPI4VI4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XZ6M6LPI4VI4I7BD","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XZ6M6LPI","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XZ6M6LPI4VI4I7BDMLUUWGVOYI","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T05:32:33Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"14c32c8575f8bb7cce681c0315324cbc568408c6f81c155717889296dc221406","abstract_canon_sha256":"78eba1f421f9238f5b58656f200a5262029d0977d5a9d1a6f7ff541f389e5b08"},"schema_version":"1.0"},"canonical_sha256":"be7ccf2de8e551c47c2362e94b1aaec22d9d13db5299a6568f93786f7f1c3176","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:20.878999Z","signature_b64":"3F5VI4Jn/6m48wFKPuTbtkDIOgvjwsiaXYWoHP3tTJvCMaHqCqEOmB1BWdbt09kp014WdiTZXpfjDN//ZcTlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be7ccf2de8e551c47c2362e94b1aaec22d9d13db5299a6568f93786f7f1c3176","last_reissued_at":"2026-05-18T03:07:20.878622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:20.878622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1247","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-18T03:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKoxCCbNidGTkhLyjardAWrfKHhhgiTUwAxTIBAa/e0VH2N3NX4/Fer9QBAd/CKbWgzMCRQP3TheXc9K14+yAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:56:05.856119Z"},"content_sha256":"2a54284416416d6782dfb91065098de6683b90d1d7d9f8c739a2e4392170f259","schema_version":"1.0","event_id":"sha256:2a54284416416d6782dfb91065098de6683b90d1d7d9f8c739a2e4392170f259"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XZ6M6LPI4VI4I7BDMLUUWGVOYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Linear Programming with Constraints Unknown","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Ning Chen, Shengyu Zhang, Xiaohui Bei","submitted_at":"2013-04-04T05:32:33Z","abstract_excerpt":"What is the value of input information in solving linear programming? The celebrated ellipsoid algorithm tells us that the full information of input constraints is not necessary; the algorithm works as long as there exists an oracle that, on a proposed candidate solution, returns a violation in the format of a separating hyperplane. Can linear programming still be efficiently solved if the returned violation is in other formats?\n  We study this question in a trial-and-error framework: there is an oracle that, upon a proposed solution, returns the index of a violated constraint (with the conten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1247","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-18T03:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3eniqFfAA9gUNU16i42C4sc9oMHZgIOnAkq9/h1tfpVWbG+zUf153W/CBp2DEaC93nNN4qu/6HsAFxHuNNNIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:56:05.856720Z"},"content_sha256":"fbed8b227ec6e7b643df5977a63370c95abffe661383c92bebf194e7304e138d","schema_version":"1.0","event_id":"sha256:fbed8b227ec6e7b643df5977a63370c95abffe661383c92bebf194e7304e138d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZ6M6LPI4VI4I7BDMLUUWGVOYI/bundle.json","state_url":"https://pith.science/pith/XZ6M6LPI4VI4I7BDMLUUWGVOYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZ6M6LPI4VI4I7BDMLUUWGVOYI/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-25T18:56:05Z","links":{"resolver":"https://pith.science/pith/XZ6M6LPI4VI4I7BDMLUUWGVOYI","bundle":"https://pith.science/pith/XZ6M6LPI4VI4I7BDMLUUWGVOYI/bundle.json","state":"https://pith.science/pith/XZ6M6LPI4VI4I7BDMLUUWGVOYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZ6M6LPI4VI4I7BDMLUUWGVOYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XZ6M6LPI4VI4I7BDMLUUWGVOYI","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":"78eba1f421f9238f5b58656f200a5262029d0977d5a9d1a6f7ff541f389e5b08","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T05:32:33Z","title_canon_sha256":"14c32c8575f8bb7cce681c0315324cbc568408c6f81c155717889296dc221406"},"schema_version":"1.0","source":{"id":"1304.1247","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1247","created_at":"2026-05-18T03:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1247v2","created_at":"2026-05-18T03:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1247","created_at":"2026-05-18T03:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"XZ6M6LPI4VI4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XZ6M6LPI4VI4I7BD","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XZ6M6LPI","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:fbed8b227ec6e7b643df5977a63370c95abffe661383c92bebf194e7304e138d","target":"graph","created_at":"2026-05-18T03:07:20Z","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":"What is the value of input information in solving linear programming? The celebrated ellipsoid algorithm tells us that the full information of input constraints is not necessary; the algorithm works as long as there exists an oracle that, on a proposed candidate solution, returns a violation in the format of a separating hyperplane. Can linear programming still be efficiently solved if the returned violation is in other formats?\n  We study this question in a trial-and-error framework: there is an oracle that, upon a proposed solution, returns the index of a violated constraint (with the conten","authors_text":"Ning Chen, Shengyu Zhang, Xiaohui Bei","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T05:32:33Z","title":"Solving Linear Programming with Constraints Unknown"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1247","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:2a54284416416d6782dfb91065098de6683b90d1d7d9f8c739a2e4392170f259","target":"record","created_at":"2026-05-18T03:07:20Z","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":"78eba1f421f9238f5b58656f200a5262029d0977d5a9d1a6f7ff541f389e5b08","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T05:32:33Z","title_canon_sha256":"14c32c8575f8bb7cce681c0315324cbc568408c6f81c155717889296dc221406"},"schema_version":"1.0","source":{"id":"1304.1247","kind":"arxiv","version":2}},"canonical_sha256":"be7ccf2de8e551c47c2362e94b1aaec22d9d13db5299a6568f93786f7f1c3176","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be7ccf2de8e551c47c2362e94b1aaec22d9d13db5299a6568f93786f7f1c3176","first_computed_at":"2026-05-18T03:07:20.878622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:20.878622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3F5VI4Jn/6m48wFKPuTbtkDIOgvjwsiaXYWoHP3tTJvCMaHqCqEOmB1BWdbt09kp014WdiTZXpfjDN//ZcTlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:20.878999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1247","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a54284416416d6782dfb91065098de6683b90d1d7d9f8c739a2e4392170f259","sha256:fbed8b227ec6e7b643df5977a63370c95abffe661383c92bebf194e7304e138d"],"state_sha256":"3ef6df02f5b051888faef70c7cfb0fc73900ea7c38bd90b00a534994cb5c0b6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0D+1FcceqNiF4XN4RycMKsXFtNbGvVfAATvxzI7IIeabVen5v5ADz0wMDHzdROOWhC5mqW6LbqWcKyOc9eLBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:56:05.860072Z","bundle_sha256":"8b9e8747f38ffb24e919f7f553aeaaa3cbb0647ba2e0472d77623d340dfc5143"}}