{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:W6ECNLJALPMOKCEURFB4L5CNWC","short_pith_number":"pith:W6ECNLJA","canonical_record":{"source":{"id":"1908.10248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-27T14:56:12Z","cross_cats_sorted":[],"title_canon_sha256":"b0f81f5f7f5322e1d16db4dbbde9762a15f0a5e1c18169e66f798efc63c79d16","abstract_canon_sha256":"7173a590d5e94b0a4a3ee81e4d820f390ef2b7ecd9f53975d63b91a36fc79e55"},"schema_version":"1.0"},"canonical_sha256":"b78826ad205bd8e508948943c5f44db0b14a7ea9140bd816a7e0366771e5e483","source":{"kind":"arxiv","id":"1908.10248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.10248","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1908.10248v1","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10248","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"W6ECNLJALPMO","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"pith_short_16","alias_value":"W6ECNLJALPMOKCEU","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"pith_short_8","alias_value":"W6ECNLJA","created_at":"2026-07-04T23:59:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:W6ECNLJALPMOKCEURFB4L5CNWC","target":"record","payload":{"canonical_record":{"source":{"id":"1908.10248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-27T14:56:12Z","cross_cats_sorted":[],"title_canon_sha256":"b0f81f5f7f5322e1d16db4dbbde9762a15f0a5e1c18169e66f798efc63c79d16","abstract_canon_sha256":"7173a590d5e94b0a4a3ee81e4d820f390ef2b7ecd9f53975d63b91a36fc79e55"},"schema_version":"1.0"},"canonical_sha256":"b78826ad205bd8e508948943c5f44db0b14a7ea9140bd816a7e0366771e5e483","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:55.581981Z","signature_b64":"zZevxewKsOqo9k2BUnngUSr2LEcfWM7GWwDCZcfiG8HE55FlFk5HWkxHka2G8Jt6PxtSuNMEQoLgcavoMMWcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b78826ad205bd8e508948943c5f44db0b14a7ea9140bd816a7e0366771e5e483","last_reissued_at":"2026-07-04T23:59:55.581534Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:55.581534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.10248","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-04T23:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkFRBIUsgUaD9mQVt/VmrVxFczrmhS4ZpMhzddEiObwv8Z51Da3M8iDyVVizUBLBX9zFDdPXyFY74dQVGJlJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:17:33.898464Z"},"content_sha256":"d4f53dc4ff05bac9bad4eb23459ee007fa79e3155692924102911ac599201028","schema_version":"1.0","event_id":"sha256:d4f53dc4ff05bac9bad4eb23459ee007fa79e3155692924102911ac599201028"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:W6ECNLJALPMOKCEURFB4L5CNWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness Amplification of Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Elazar Goldenberg, Karthik C. S.","submitted_at":"2019-08-27T14:56:12Z","abstract_excerpt":"In this paper, we prove a general hardness amplification scheme for optimization problems based on the technique of direct products. We say that an optimization problem $\\Pi$ is direct product feasible if it is possible to efficiently aggregate any $k$ instances of $\\Pi$ and form one large instance of $\\Pi$ such that given an optimal feasible solution to the larger instance, we can efficiently find optimal feasible solutions to all the $k$ smaller instances. Given a direct product feasible optimization problem $\\Pi$, our hardness amplification theorem may be informally stated as follows: If th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10248","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/1908.10248/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-04T23:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iY4Jfh10KL2lmbKEs7AHAstIRvww6wgvbyJxaucl6R43WOdRVUNortME+0GvcsiZDJZTab65QHJEEcepdSENAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:17:33.899334Z"},"content_sha256":"15cae951abc939c85471b792d7678468cb5b7163ba7f28081c452348f0eb5f4b","schema_version":"1.0","event_id":"sha256:15cae951abc939c85471b792d7678468cb5b7163ba7f28081c452348f0eb5f4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6ECNLJALPMOKCEURFB4L5CNWC/bundle.json","state_url":"https://pith.science/pith/W6ECNLJALPMOKCEURFB4L5CNWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6ECNLJALPMOKCEURFB4L5CNWC/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-21T13:17:33Z","links":{"resolver":"https://pith.science/pith/W6ECNLJALPMOKCEURFB4L5CNWC","bundle":"https://pith.science/pith/W6ECNLJALPMOKCEURFB4L5CNWC/bundle.json","state":"https://pith.science/pith/W6ECNLJALPMOKCEURFB4L5CNWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6ECNLJALPMOKCEURFB4L5CNWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:W6ECNLJALPMOKCEURFB4L5CNWC","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":"7173a590d5e94b0a4a3ee81e4d820f390ef2b7ecd9f53975d63b91a36fc79e55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-27T14:56:12Z","title_canon_sha256":"b0f81f5f7f5322e1d16db4dbbde9762a15f0a5e1c18169e66f798efc63c79d16"},"schema_version":"1.0","source":{"id":"1908.10248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.10248","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1908.10248v1","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10248","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"W6ECNLJALPMO","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"pith_short_16","alias_value":"W6ECNLJALPMOKCEU","created_at":"2026-07-04T23:59:55Z"},{"alias_kind":"pith_short_8","alias_value":"W6ECNLJA","created_at":"2026-07-04T23:59:55Z"}],"graph_snapshots":[{"event_id":"sha256:15cae951abc939c85471b792d7678468cb5b7163ba7f28081c452348f0eb5f4b","target":"graph","created_at":"2026-07-04T23:59:55Z","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/1908.10248/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we prove a general hardness amplification scheme for optimization problems based on the technique of direct products. We say that an optimization problem $\\Pi$ is direct product feasible if it is possible to efficiently aggregate any $k$ instances of $\\Pi$ and form one large instance of $\\Pi$ such that given an optimal feasible solution to the larger instance, we can efficiently find optimal feasible solutions to all the $k$ smaller instances. Given a direct product feasible optimization problem $\\Pi$, our hardness amplification theorem may be informally stated as follows: If th","authors_text":"Elazar Goldenberg, Karthik C. S.","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10248","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:d4f53dc4ff05bac9bad4eb23459ee007fa79e3155692924102911ac599201028","target":"record","created_at":"2026-07-04T23:59:55Z","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":"7173a590d5e94b0a4a3ee81e4d820f390ef2b7ecd9f53975d63b91a36fc79e55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-27T14:56:12Z","title_canon_sha256":"b0f81f5f7f5322e1d16db4dbbde9762a15f0a5e1c18169e66f798efc63c79d16"},"schema_version":"1.0","source":{"id":"1908.10248","kind":"arxiv","version":1}},"canonical_sha256":"b78826ad205bd8e508948943c5f44db0b14a7ea9140bd816a7e0366771e5e483","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b78826ad205bd8e508948943c5f44db0b14a7ea9140bd816a7e0366771e5e483","first_computed_at":"2026-07-04T23:59:55.581534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:55.581534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zZevxewKsOqo9k2BUnngUSr2LEcfWM7GWwDCZcfiG8HE55FlFk5HWkxHka2G8Jt6PxtSuNMEQoLgcavoMMWcCw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:55.581981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.10248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4f53dc4ff05bac9bad4eb23459ee007fa79e3155692924102911ac599201028","sha256:15cae951abc939c85471b792d7678468cb5b7163ba7f28081c452348f0eb5f4b"],"state_sha256":"6cfb2c3aefafe1f626060611eb5181dca4c4361fc1501e0c331dcaa655fcc232"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eE4k1Mu4HhwLc16B3JbS/akvNuuZKuUNfGctqhxMfiyMF1/owQzRcNB+7wMNtRVRo894jjBD0xSjh1iUOQMYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T13:17:33.905039Z","bundle_sha256":"1a7726acd6924c9e55e8eb9eff93ab5955f16c67769950fba947eb2f6bf5abeb"}}