{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:QC6JEF3OGTS4MTLBFC55TTS2ZE","short_pith_number":"pith:QC6JEF3O","canonical_record":{"source":{"id":"2105.01782","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-04T22:18:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5e4dce61593289fb979e839167b77649b5a2b6d7db6672dec8fa1c699b0bd3f5","abstract_canon_sha256":"cbab3d0eb057259f83c276fca9c9b5475a89dab48425de4d0c7fa9af6152353e"},"schema_version":"1.0"},"canonical_sha256":"80bc92176e34e5c64d6128bbd9ce5ac92756534a88bac9a22e918e9fbd0475eb","source":{"kind":"arxiv","id":"2105.01782","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.01782","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"2105.01782v3","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01782","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"QC6JEF3OGTS4","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"QC6JEF3OGTS4MTLB","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"QC6JEF3O","created_at":"2026-07-05T08:51:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:QC6JEF3OGTS4MTLBFC55TTS2ZE","target":"record","payload":{"canonical_record":{"source":{"id":"2105.01782","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-04T22:18:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5e4dce61593289fb979e839167b77649b5a2b6d7db6672dec8fa1c699b0bd3f5","abstract_canon_sha256":"cbab3d0eb057259f83c276fca9c9b5475a89dab48425de4d0c7fa9af6152353e"},"schema_version":"1.0"},"canonical_sha256":"80bc92176e34e5c64d6128bbd9ce5ac92756534a88bac9a22e918e9fbd0475eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:51:08.894667Z","signature_b64":"zpXzT7vBaEI3LYaMLJWrNu9KNKj8sLckFGzjf7s2n8FpKSJOCRnuveAREaSPMFGXSbPfwvWCCtT9GYwX/NpzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80bc92176e34e5c64d6128bbd9ce5ac92756534a88bac9a22e918e9fbd0475eb","last_reissued_at":"2026-07-05T08:51:08.894313Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:51:08.894313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.01782","source_version":3,"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-05T08:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O6RlnfRaNN/co5rfsQvFjW03XPpJ582br8A4rE7q+P900h7geFuKRKuNTwa9oFt9pfCacEW9sXLLyZS2vAqFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:38:45.866285Z"},"content_sha256":"dfb9e02a1fd85c57e7dea9c820a0a820a8ce640b2354accde4b532b67d151df2","schema_version":"1.0","event_id":"sha256:dfb9e02a1fd85c57e7dea9c820a0a820a8ce640b2354accde4b532b67d151df2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:QC6JEF3OGTS4MTLBFC55TTS2ZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming approximation resistance of every ordering CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Madhu Sudan, Noah G. Singer, Santhoshini Velusamy","submitted_at":"2021-05-04T22:18:04Z","abstract_excerpt":"An ordering constraint satisfaction problem (OCSP) is defined by a family $\\mathcal{F}$ of predicates mapping permutations on $\\{1,\\ldots,k\\}$ to $\\{0,1\\}$. An instance of Max-OCSP($\\mathcal{F}$) on $n$ variables consists of a list of constraints, each consisting of a predicate from $\\mathcal{F}$ applied on $k$ distinct variables. The goal is to find an ordering of the $n$ variables that maximizes the number of constraints for which the induced ordering on the $k$ variables satisfies the predicate. OCSPs capture well-studied problems including `maximum acyclic subgraph' (MAS) and \"maximum betw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.01782","kind":"arxiv","version":3},"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/2105.01782/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-05T08:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFv8QrzUzd1vGOfK1OZD4plDT9lICXSEkX8Rx7/PegmduQN+3FgCJ1+OuGZQ88dJEHSAt63atwbK++dlAuL7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:38:45.867219Z"},"content_sha256":"403faf5c9aea4dfc38451c8a89216481718b8a1616e9287da3fb019c33d63e24","schema_version":"1.0","event_id":"sha256:403faf5c9aea4dfc38451c8a89216481718b8a1616e9287da3fb019c33d63e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/bundle.json","state_url":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/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-04T11:38:45Z","links":{"resolver":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE","bundle":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/bundle.json","state":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:QC6JEF3OGTS4MTLBFC55TTS2ZE","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":"cbab3d0eb057259f83c276fca9c9b5475a89dab48425de4d0c7fa9af6152353e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-04T22:18:04Z","title_canon_sha256":"5e4dce61593289fb979e839167b77649b5a2b6d7db6672dec8fa1c699b0bd3f5"},"schema_version":"1.0","source":{"id":"2105.01782","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.01782","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"2105.01782v3","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01782","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"QC6JEF3OGTS4","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"QC6JEF3OGTS4MTLB","created_at":"2026-07-05T08:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"QC6JEF3O","created_at":"2026-07-05T08:51:08Z"}],"graph_snapshots":[{"event_id":"sha256:403faf5c9aea4dfc38451c8a89216481718b8a1616e9287da3fb019c33d63e24","target":"graph","created_at":"2026-07-05T08:51:08Z","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/2105.01782/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An ordering constraint satisfaction problem (OCSP) is defined by a family $\\mathcal{F}$ of predicates mapping permutations on $\\{1,\\ldots,k\\}$ to $\\{0,1\\}$. An instance of Max-OCSP($\\mathcal{F}$) on $n$ variables consists of a list of constraints, each consisting of a predicate from $\\mathcal{F}$ applied on $k$ distinct variables. The goal is to find an ordering of the $n$ variables that maximizes the number of constraints for which the induced ordering on the $k$ variables satisfies the predicate. OCSPs capture well-studied problems including `maximum acyclic subgraph' (MAS) and \"maximum betw","authors_text":"Madhu Sudan, Noah G. Singer, Santhoshini Velusamy","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-04T22:18:04Z","title":"Streaming approximation resistance of every ordering CSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.01782","kind":"arxiv","version":3},"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:dfb9e02a1fd85c57e7dea9c820a0a820a8ce640b2354accde4b532b67d151df2","target":"record","created_at":"2026-07-05T08:51:08Z","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":"cbab3d0eb057259f83c276fca9c9b5475a89dab48425de4d0c7fa9af6152353e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-04T22:18:04Z","title_canon_sha256":"5e4dce61593289fb979e839167b77649b5a2b6d7db6672dec8fa1c699b0bd3f5"},"schema_version":"1.0","source":{"id":"2105.01782","kind":"arxiv","version":3}},"canonical_sha256":"80bc92176e34e5c64d6128bbd9ce5ac92756534a88bac9a22e918e9fbd0475eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80bc92176e34e5c64d6128bbd9ce5ac92756534a88bac9a22e918e9fbd0475eb","first_computed_at":"2026-07-05T08:51:08.894313Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:51:08.894313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpXzT7vBaEI3LYaMLJWrNu9KNKj8sLckFGzjf7s2n8FpKSJOCRnuveAREaSPMFGXSbPfwvWCCtT9GYwX/NpzDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:51:08.894667Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.01782","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfb9e02a1fd85c57e7dea9c820a0a820a8ce640b2354accde4b532b67d151df2","sha256:403faf5c9aea4dfc38451c8a89216481718b8a1616e9287da3fb019c33d63e24"],"state_sha256":"fed7d48eb983bff94ba113ddcd9b434a01ceaeb6cb1bf42d67d13102b5763377"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8IrTg7nzQQq+1CKTkGLke771qIs6y+ToToxyuZQrnZkN2chH83hwTxQ4CWu7uCiTBbRviCynTafJPaOrlUDZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:38:45.872887Z","bundle_sha256":"df167d84036e896f68dd750b3b9cff07e2fe383754d3f8abc708af0ac49719db"}}