{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4H2EFFN57BZWCOXAE4DP24MW6F","short_pith_number":"pith:4H2EFFN5","canonical_record":{"source":{"id":"1706.02075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-07T07:36:19Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"688a175cb5d6a2d2cad1a4bec6f7d78a7f252313a95f4706a6e5a8b0622b85a2","abstract_canon_sha256":"6efcec42fbf798d9f1641180591dac9cb9f3d2f7a2f99fc9acaa8d04e1059e93"},"schema_version":"1.0"},"canonical_sha256":"e1f44295bdf873613ae02706fd7196f179e306b18142071787d0cade7745e523","source":{"kind":"arxiv","id":"1706.02075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02075","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02075v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02075","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"4H2EFFN57BZW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4H2EFFN57BZWCOXA","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4H2EFFN5","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4H2EFFN57BZWCOXAE4DP24MW6F","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-07T07:36:19Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"688a175cb5d6a2d2cad1a4bec6f7d78a7f252313a95f4706a6e5a8b0622b85a2","abstract_canon_sha256":"6efcec42fbf798d9f1641180591dac9cb9f3d2f7a2f99fc9acaa8d04e1059e93"},"schema_version":"1.0"},"canonical_sha256":"e1f44295bdf873613ae02706fd7196f179e306b18142071787d0cade7745e523","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:50.173637Z","signature_b64":"kIw7wKgMDLIV97JngL7tQVIYUHT05rFmtFg9PqFzP6y2zW96BXLXlwQP3TD8IvcB7dZYiF/5cUPweL924YONBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f44295bdf873613ae02706fd7196f179e306b18142071787d0cade7745e523","last_reissued_at":"2026-05-18T00:42:50.172914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:50.172914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02075","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:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k94qDjMrCSxXElvC/EfmGqsjKBK/x/ZLsEIZX/FnK4GVq1n7/R8rMKRcG0vtVOztaktTHiGLv+4vV+YjHOjwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:10:12.331514Z"},"content_sha256":"19cdbd99640df660e4c86b38ba23262b7523e494ee5baee06c0cd527309e7f52","schema_version":"1.0","event_id":"sha256:19cdbd99640df660e4c86b38ba23262b7523e494ee5baee06c0cd527309e7f52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4H2EFFN57BZWCOXAE4DP24MW6F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Shifted Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Asaf Levin, Martin Koutecky, Shmuel Onn, Syed M. Meesum","submitted_at":"2017-06-07T07:36:19Z","abstract_excerpt":"Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. It captures well studied and diverse problems ranging from congestive to partitioning problems. In particular, every standard combinatorial optimization problem has its shifted counterpart, which is typically much harder. Here we initiate a study of approximation algorithms for this broad optimization framework."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02075","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:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvaLM2mXJeNmT2uJ1TWiySv5qJ1/ZLLdY5Y0VGO9+xVDGF4HZiJgmcdsh21U8qi5vP9x3sZVWz/KIYnGFvOaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:10:12.331874Z"},"content_sha256":"0bed6491a9ca060598e902a58935e4b05d5cd34ec484cf6393dca7791f8110a0","schema_version":"1.0","event_id":"sha256:0bed6491a9ca060598e902a58935e4b05d5cd34ec484cf6393dca7791f8110a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4H2EFFN57BZWCOXAE4DP24MW6F/bundle.json","state_url":"https://pith.science/pith/4H2EFFN57BZWCOXAE4DP24MW6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4H2EFFN57BZWCOXAE4DP24MW6F/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-11T13:10:12Z","links":{"resolver":"https://pith.science/pith/4H2EFFN57BZWCOXAE4DP24MW6F","bundle":"https://pith.science/pith/4H2EFFN57BZWCOXAE4DP24MW6F/bundle.json","state":"https://pith.science/pith/4H2EFFN57BZWCOXAE4DP24MW6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4H2EFFN57BZWCOXAE4DP24MW6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4H2EFFN57BZWCOXAE4DP24MW6F","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":"6efcec42fbf798d9f1641180591dac9cb9f3d2f7a2f99fc9acaa8d04e1059e93","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-07T07:36:19Z","title_canon_sha256":"688a175cb5d6a2d2cad1a4bec6f7d78a7f252313a95f4706a6e5a8b0622b85a2"},"schema_version":"1.0","source":{"id":"1706.02075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02075","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02075v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02075","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"4H2EFFN57BZW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4H2EFFN57BZWCOXA","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4H2EFFN5","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:0bed6491a9ca060598e902a58935e4b05d5cd34ec484cf6393dca7791f8110a0","target":"graph","created_at":"2026-05-18T00:42:50Z","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":"Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. It captures well studied and diverse problems ranging from congestive to partitioning problems. In particular, every standard combinatorial optimization problem has its shifted counterpart, which is typically much harder. Here we initiate a study of approximation algorithms for this broad optimization framework.","authors_text":"Asaf Levin, Martin Koutecky, Shmuel Onn, Syed M. Meesum","cross_cats":["cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-07T07:36:19Z","title":"Approximate Shifted Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02075","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:19cdbd99640df660e4c86b38ba23262b7523e494ee5baee06c0cd527309e7f52","target":"record","created_at":"2026-05-18T00:42:50Z","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":"6efcec42fbf798d9f1641180591dac9cb9f3d2f7a2f99fc9acaa8d04e1059e93","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-07T07:36:19Z","title_canon_sha256":"688a175cb5d6a2d2cad1a4bec6f7d78a7f252313a95f4706a6e5a8b0622b85a2"},"schema_version":"1.0","source":{"id":"1706.02075","kind":"arxiv","version":1}},"canonical_sha256":"e1f44295bdf873613ae02706fd7196f179e306b18142071787d0cade7745e523","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1f44295bdf873613ae02706fd7196f179e306b18142071787d0cade7745e523","first_computed_at":"2026-05-18T00:42:50.172914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:50.172914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kIw7wKgMDLIV97JngL7tQVIYUHT05rFmtFg9PqFzP6y2zW96BXLXlwQP3TD8IvcB7dZYiF/5cUPweL924YONBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:50.173637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19cdbd99640df660e4c86b38ba23262b7523e494ee5baee06c0cd527309e7f52","sha256:0bed6491a9ca060598e902a58935e4b05d5cd34ec484cf6393dca7791f8110a0"],"state_sha256":"2573053ee94c882b244d8270a38716249f014053cf679fdd55c86d5f68a78d95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a9j4IQdpUFmabzmZf5aGv8BL3xyOcYII5U/QuTPrdRAG/PC9C2wute01eLMLuJOSOp7y0nII2RDb4jwGpBL+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:10:12.334140Z","bundle_sha256":"643b1c1b7df1ac5bb55189a4710f4103dc0c3952fa0fb83a3a0b6f7e937317dc"}}