{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QC6JEF3OGTS4MTLBFC55TTS2ZE","short_pith_number":"pith:QC6JEF3O","schema_version":"1.0","canonical_sha256":"80bc92176e34e5c64d6128bbd9ce5ac92756534a88bac9a22e918e9fbd0475eb","source":{"kind":"arxiv","id":"2105.01782","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.01782","created_at":"2026-07-05T08:51:08.894376+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.01782v3","created_at":"2026-07-05T08:51:08.894376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01782","created_at":"2026-07-05T08:51:08.894376+00:00"},{"alias_kind":"pith_short_12","alias_value":"QC6JEF3OGTS4","created_at":"2026-07-05T08:51:08.894376+00:00"},{"alias_kind":"pith_short_16","alias_value":"QC6JEF3OGTS4MTLB","created_at":"2026-07-05T08:51:08.894376+00:00"},{"alias_kind":"pith_short_8","alias_value":"QC6JEF3O","created_at":"2026-07-05T08:51:08.894376+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE","json":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE.json","graph_json":"https://pith.science/api/pith-number/QC6JEF3OGTS4MTLBFC55TTS2ZE/graph.json","events_json":"https://pith.science/api/pith-number/QC6JEF3OGTS4MTLBFC55TTS2ZE/events.json","paper":"https://pith.science/paper/QC6JEF3O"},"agent_actions":{"view_html":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE","download_json":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE.json","view_paper":"https://pith.science/paper/QC6JEF3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.01782&json=true","fetch_graph":"https://pith.science/api/pith-number/QC6JEF3OGTS4MTLBFC55TTS2ZE/graph.json","fetch_events":"https://pith.science/api/pith-number/QC6JEF3OGTS4MTLBFC55TTS2ZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/action/storage_attestation","attest_author":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/action/author_attestation","sign_citation":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/action/citation_signature","submit_replication":"https://pith.science/pith/QC6JEF3OGTS4MTLBFC55TTS2ZE/action/replication_record"}},"created_at":"2026-07-05T08:51:08.894376+00:00","updated_at":"2026-07-05T08:51:08.894376+00:00"}