{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HRT4DYWIB6OBHNIFS47BYF4EU2","short_pith_number":"pith:HRT4DYWI","canonical_record":{"source":{"id":"1607.04787","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-16T18:52:51Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"0fc719a6d056ceecf6510bb5cbfb8b8c51a27e701650df182eebee7e35ab3f41","abstract_canon_sha256":"365a1e580d1cbd269dbc9000a674335826ad443027ebf505cc8fe2339d90554a"},"schema_version":"1.0"},"canonical_sha256":"3c67c1e2c80f9c13b505973e1c1784a682c061223a5df6743ca6289d36c7e397","source":{"kind":"arxiv","id":"1607.04787","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04787","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04787v4","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04787","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"HRT4DYWIB6OB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HRT4DYWIB6OBHNIF","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HRT4DYWI","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HRT4DYWIB6OBHNIFS47BYF4EU2","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04787","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-16T18:52:51Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"0fc719a6d056ceecf6510bb5cbfb8b8c51a27e701650df182eebee7e35ab3f41","abstract_canon_sha256":"365a1e580d1cbd269dbc9000a674335826ad443027ebf505cc8fe2339d90554a"},"schema_version":"1.0"},"canonical_sha256":"3c67c1e2c80f9c13b505973e1c1784a682c061223a5df6743ca6289d36c7e397","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:03.913239Z","signature_b64":"3Xeo3zEVvioaTusSO8Lu7+dnZggfsl4Gbamc5XJf4kRkgWJFbRbblSqJAOcdhSxFO61W0VCAv5BRloRjiFt7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c67c1e2c80f9c13b505973e1c1784a682c061223a5df6743ca6289d36c7e397","last_reissued_at":"2026-05-17T23:59:03.912718Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:03.912718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04787","source_version":4,"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-17T23:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MsCVNF2h5AfFNRnN2LO3VlKc6fhpP9avBIRICRadhEkmv7UnbhpFXRQSCK8X4o3Lkfl6JWH8S2bPGpikdNwEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:01:11.853920Z"},"content_sha256":"3884b072845a1e1f509b09ffec97fe9e2c3217ca69c551e24da3a1aaca04ba1b","schema_version":"1.0","event_id":"sha256:3884b072845a1e1f509b09ffec97fe9e2c3217ca69c551e24da3a1aaca04ba1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HRT4DYWIB6OBHNIFS47BYF4EU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust algorithms with polynomial loss for near-unanimity CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.DS","authors_text":"Andrei Krokhin, Jakub Opr\\v{s}al, Konstantin Makarychev, Marcin Kozik, V\\'ictor Dalmau, Yury Makarychev","submitted_at":"2016-07-16T18:52:51Z","abstract_excerpt":"An instance of the Constraint Satisfaction Problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain to the variables so that all constraints are satisfied. In the optimization version, the goal is to maximize the number of satisfied constraints. An approximation algorithm for CSP is called robust if it outputs an assignment satisfying a $(1-g(\\varepsilon))$-fraction of constraints on any $(1-\\varepsilon)$-satisfiable instance, where the loss function $g$ is such that $g(\\varepsilon)\\rightarrow 0$ as $\\varepsilon\\ri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04787","kind":"arxiv","version":4},"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-17T23:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9r1FnOewl8q0iyFudTeChs2CXIN0n8jHvm6oFUakkZ5wUKWR3Wy8vPBHKy4ZiS/kE8uv7CnHw2lviHeCn3eDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:01:11.854565Z"},"content_sha256":"cd62be2ffc19e172557b08176edf4768b0e3ced748a5854d4700f887a355dfad","schema_version":"1.0","event_id":"sha256:cd62be2ffc19e172557b08176edf4768b0e3ced748a5854d4700f887a355dfad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRT4DYWIB6OBHNIFS47BYF4EU2/bundle.json","state_url":"https://pith.science/pith/HRT4DYWIB6OBHNIFS47BYF4EU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRT4DYWIB6OBHNIFS47BYF4EU2/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-26T17:01:11Z","links":{"resolver":"https://pith.science/pith/HRT4DYWIB6OBHNIFS47BYF4EU2","bundle":"https://pith.science/pith/HRT4DYWIB6OBHNIFS47BYF4EU2/bundle.json","state":"https://pith.science/pith/HRT4DYWIB6OBHNIFS47BYF4EU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRT4DYWIB6OBHNIFS47BYF4EU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HRT4DYWIB6OBHNIFS47BYF4EU2","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":"365a1e580d1cbd269dbc9000a674335826ad443027ebf505cc8fe2339d90554a","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-16T18:52:51Z","title_canon_sha256":"0fc719a6d056ceecf6510bb5cbfb8b8c51a27e701650df182eebee7e35ab3f41"},"schema_version":"1.0","source":{"id":"1607.04787","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04787","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04787v4","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04787","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"HRT4DYWIB6OB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HRT4DYWIB6OBHNIF","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HRT4DYWI","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:cd62be2ffc19e172557b08176edf4768b0e3ced748a5854d4700f887a355dfad","target":"graph","created_at":"2026-05-17T23:59:03Z","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":"An instance of the Constraint Satisfaction Problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain to the variables so that all constraints are satisfied. In the optimization version, the goal is to maximize the number of satisfied constraints. An approximation algorithm for CSP is called robust if it outputs an assignment satisfying a $(1-g(\\varepsilon))$-fraction of constraints on any $(1-\\varepsilon)$-satisfiable instance, where the loss function $g$ is such that $g(\\varepsilon)\\rightarrow 0$ as $\\varepsilon\\ri","authors_text":"Andrei Krokhin, Jakub Opr\\v{s}al, Konstantin Makarychev, Marcin Kozik, V\\'ictor Dalmau, Yury Makarychev","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-16T18:52:51Z","title":"Robust algorithms with polynomial loss for near-unanimity CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04787","kind":"arxiv","version":4},"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:3884b072845a1e1f509b09ffec97fe9e2c3217ca69c551e24da3a1aaca04ba1b","target":"record","created_at":"2026-05-17T23:59:03Z","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":"365a1e580d1cbd269dbc9000a674335826ad443027ebf505cc8fe2339d90554a","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-16T18:52:51Z","title_canon_sha256":"0fc719a6d056ceecf6510bb5cbfb8b8c51a27e701650df182eebee7e35ab3f41"},"schema_version":"1.0","source":{"id":"1607.04787","kind":"arxiv","version":4}},"canonical_sha256":"3c67c1e2c80f9c13b505973e1c1784a682c061223a5df6743ca6289d36c7e397","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c67c1e2c80f9c13b505973e1c1784a682c061223a5df6743ca6289d36c7e397","first_computed_at":"2026-05-17T23:59:03.912718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:03.912718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Xeo3zEVvioaTusSO8Lu7+dnZggfsl4Gbamc5XJf4kRkgWJFbRbblSqJAOcdhSxFO61W0VCAv5BRloRjiFt7BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:03.913239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04787","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3884b072845a1e1f509b09ffec97fe9e2c3217ca69c551e24da3a1aaca04ba1b","sha256:cd62be2ffc19e172557b08176edf4768b0e3ced748a5854d4700f887a355dfad"],"state_sha256":"e6472bae812c2a7d6c09d5ca181474587b6d74121245d89c890f42c7656a27b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFmjQp9qDL6lb/85V2flBo6i9sEPeAzEg19kLwLUdSlcK8qanmS6NgGx8RFIdQxZDgz/zHb50xVq2skxQisnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:01:11.857998Z","bundle_sha256":"a5683869190ca2fe49bb18a9e96f1769399afbbe0aaafa1956b67b9c7d183839"}}