{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:TMNMNX5WCMNQ2U7BV3GGBQH4FR","short_pith_number":"pith:TMNMNX5W","canonical_record":{"source":{"id":"cs/0610119","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-10-19T22:10:32Z","cross_cats_sorted":[],"title_canon_sha256":"4227a256b3dd4a9bf35cf0d31ee5a5ac19b32618201717ae0e3936edc167a5e2","abstract_canon_sha256":"148eb4c3616ae9fb847869c16677c74e424bad05082fd8ef8975055dfb49390d"},"schema_version":"1.0"},"canonical_sha256":"9b1ac6dfb6131b0d53e1aecc60c0fc2c7f44c61dd278071d4f22b3a4c82242f7","source":{"kind":"arxiv","id":"cs/0610119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610119","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610119v1","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610119","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"pith_short_12","alias_value":"TMNMNX5WCMNQ","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"pith_short_16","alias_value":"TMNMNX5WCMNQ2U7B","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"pith_short_8","alias_value":"TMNMNX5W","created_at":"2026-07-04T14:57:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:TMNMNX5WCMNQ2U7BV3GGBQH4FR","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0610119","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-10-19T22:10:32Z","cross_cats_sorted":[],"title_canon_sha256":"4227a256b3dd4a9bf35cf0d31ee5a5ac19b32618201717ae0e3936edc167a5e2","abstract_canon_sha256":"148eb4c3616ae9fb847869c16677c74e424bad05082fd8ef8975055dfb49390d"},"schema_version":"1.0"},"canonical_sha256":"9b1ac6dfb6131b0d53e1aecc60c0fc2c7f44c61dd278071d4f22b3a4c82242f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:57:01.941668Z","signature_b64":"ck2p5hzclUc5Dd0wqDgN44Px7ueyARCdV5/aGmRdgIuAUgV6suqV05ThA8XHQFuuAhtxnf08a4ti21QZyxD4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b1ac6dfb6131b0d53e1aecc60c0fc2c7f44c61dd278071d4f22b3a4c82242f7","last_reissued_at":"2026-07-04T14:57:01.941289Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:57:01.941289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0610119","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-07-04T14:57:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYyt5ZvqH12yIYvCnoLMHahpQKVUK26xXJ3v3+TeGAQ29Sg34X4FipofiVJz2AIm2cspIrR7qmd5eHVWToHCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:34:25.108041Z"},"content_sha256":"d18ab66c77884aed324053c718393e89352436560f8e3e8b11590985a594f44d","schema_version":"1.0","event_id":"sha256:d18ab66c77884aed324053c718393e89352436560f8e3e8b11590985a594f44d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:TMNMNX5WCMNQ2U7BV3GGBQH4FR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Convex Optimization by Online Game Playing","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elad Hazan","submitted_at":"2006-10-19T22:10:32Z","abstract_excerpt":"Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a $\\epsilon$ approximate solution is proportional to $\\frac{1}{\\epsilon^2}$. Recently, Bienstock and Iyengar, following Nesterov, gave an algorithm for fractional packing linear programs which runs in $\\frac{1}{\\epsilon}$ iterations. The latter algorithm requires to solve a convex quadratic program every iteration - an optimization subroutine which dominates the theoretical running time.\n  We give an algorithm for convex prog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610119","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0610119/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:57:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxhUEUETtL+cfg88cGFn65dIQ/hkz3cdJyhbQCYjiB7bz2+6RJTd6ZEBOn//4jTo7UCRTd89AkUjqj/seZR3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:34:25.108736Z"},"content_sha256":"b01af33b94cb9bd205e5cb1e22f6d2b796586fecca65753e99c5d27f059bc40a","schema_version":"1.0","event_id":"sha256:b01af33b94cb9bd205e5cb1e22f6d2b796586fecca65753e99c5d27f059bc40a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMNMNX5WCMNQ2U7BV3GGBQH4FR/bundle.json","state_url":"https://pith.science/pith/TMNMNX5WCMNQ2U7BV3GGBQH4FR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMNMNX5WCMNQ2U7BV3GGBQH4FR/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-08-17T20:34:25Z","links":{"resolver":"https://pith.science/pith/TMNMNX5WCMNQ2U7BV3GGBQH4FR","bundle":"https://pith.science/pith/TMNMNX5WCMNQ2U7BV3GGBQH4FR/bundle.json","state":"https://pith.science/pith/TMNMNX5WCMNQ2U7BV3GGBQH4FR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMNMNX5WCMNQ2U7BV3GGBQH4FR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:TMNMNX5WCMNQ2U7BV3GGBQH4FR","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":"148eb4c3616ae9fb847869c16677c74e424bad05082fd8ef8975055dfb49390d","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2006-10-19T22:10:32Z","title_canon_sha256":"4227a256b3dd4a9bf35cf0d31ee5a5ac19b32618201717ae0e3936edc167a5e2"},"schema_version":"1.0","source":{"id":"cs/0610119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610119","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610119v1","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610119","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"pith_short_12","alias_value":"TMNMNX5WCMNQ","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"pith_short_16","alias_value":"TMNMNX5WCMNQ2U7B","created_at":"2026-07-04T14:57:01Z"},{"alias_kind":"pith_short_8","alias_value":"TMNMNX5W","created_at":"2026-07-04T14:57:01Z"}],"graph_snapshots":[{"event_id":"sha256:b01af33b94cb9bd205e5cb1e22f6d2b796586fecca65753e99c5d27f059bc40a","target":"graph","created_at":"2026-07-04T14:57:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0610119/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a $\\epsilon$ approximate solution is proportional to $\\frac{1}{\\epsilon^2}$. Recently, Bienstock and Iyengar, following Nesterov, gave an algorithm for fractional packing linear programs which runs in $\\frac{1}{\\epsilon}$ iterations. The latter algorithm requires to solve a convex quadratic program every iteration - an optimization subroutine which dominates the theoretical running time.\n  We give an algorithm for convex prog","authors_text":"Elad Hazan","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2006-10-19T22:10:32Z","title":"Approximate Convex Optimization by Online Game Playing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610119","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:d18ab66c77884aed324053c718393e89352436560f8e3e8b11590985a594f44d","target":"record","created_at":"2026-07-04T14:57:01Z","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":"148eb4c3616ae9fb847869c16677c74e424bad05082fd8ef8975055dfb49390d","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2006-10-19T22:10:32Z","title_canon_sha256":"4227a256b3dd4a9bf35cf0d31ee5a5ac19b32618201717ae0e3936edc167a5e2"},"schema_version":"1.0","source":{"id":"cs/0610119","kind":"arxiv","version":1}},"canonical_sha256":"9b1ac6dfb6131b0d53e1aecc60c0fc2c7f44c61dd278071d4f22b3a4c82242f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b1ac6dfb6131b0d53e1aecc60c0fc2c7f44c61dd278071d4f22b3a4c82242f7","first_computed_at":"2026-07-04T14:57:01.941289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:57:01.941289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ck2p5hzclUc5Dd0wqDgN44Px7ueyARCdV5/aGmRdgIuAUgV6suqV05ThA8XHQFuuAhtxnf08a4ti21QZyxD4DQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:57:01.941668Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0610119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d18ab66c77884aed324053c718393e89352436560f8e3e8b11590985a594f44d","sha256:b01af33b94cb9bd205e5cb1e22f6d2b796586fecca65753e99c5d27f059bc40a"],"state_sha256":"8fb301aa999b6dc2f50ddf64cdf0b9fe8105736bb7ca1b283a033a5af02bef45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Hta6mGdKMQnP1KLihxvOhqIkAAEadCAOghPnzB9S48YA0jSnCdtzNydo90LiaeHu0w/Los3j0WpgbcKz31MAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T20:34:25.117645Z","bundle_sha256":"db6de3ab48c1ce847799050f1b975f809c76f03d442e8400fe95ef9ea877d0ed"}}