{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LWSJ5YLF4KR3AVNOD74UV4CBHG","short_pith_number":"pith:LWSJ5YLF","schema_version":"1.0","canonical_sha256":"5da49ee165e2a3b055ae1ff94af041398f66b739462ee5ba3dce7e5f7a8794e3","source":{"kind":"arxiv","id":"1802.03950","version":3},"attestation_state":"computed","paper":{"title":"Quasi-Optimal Partial Order Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Camille Coti, C\\'esar Rodr\\'iguez, Huyen T.T Nguyen, Laure Petrucci, Marcelo Sousa","submitted_at":"2018-02-12T09:55:20Z","abstract_excerpt":"A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace. Existing literature suggests that the reduction obtained by the non-optimal, state-of-the-art Source-DPOR (SDPOR) algorithm is comparable to optimal DPOR. We show the first program with $\\mathop{\\mathcal{O}}(n)$ Mazurkiewicz traces where SDPOR explores $\\mathop{\\mathcal{O}}(2^n)$ redundant schedules and identify the cause of the blow-up as an NP-hard problem. Our main contribution is a new approach, called Quasi-Optimal POR, that can arbitrarily approximate a"},"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":"1802.03950","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-12T09:55:20Z","cross_cats_sorted":[],"title_canon_sha256":"fbb5025823b1b8b795ab3f9b8bdb2053434c61ba21782dd08f822db12a2e0879","abstract_canon_sha256":"fb67ed63320a6c73039194468a9a31c64ad5a41a20a24f7563d7ea1c91011331"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:59.599378Z","signature_b64":"UNSASqgEBZf3w8wyNXe1/cEc90IgpDjEgXXoB9qGWPUrY6tEXm5iZPwtksDxpcptCXkGtyrXJB9nylEvObkgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5da49ee165e2a3b055ae1ff94af041398f66b739462ee5ba3dce7e5f7a8794e3","last_reissued_at":"2026-05-18T00:17:59.598880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:59.598880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Optimal Partial Order Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Camille Coti, C\\'esar Rodr\\'iguez, Huyen T.T Nguyen, Laure Petrucci, Marcelo Sousa","submitted_at":"2018-02-12T09:55:20Z","abstract_excerpt":"A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace. Existing literature suggests that the reduction obtained by the non-optimal, state-of-the-art Source-DPOR (SDPOR) algorithm is comparable to optimal DPOR. We show the first program with $\\mathop{\\mathcal{O}}(n)$ Mazurkiewicz traces where SDPOR explores $\\mathop{\\mathcal{O}}(2^n)$ redundant schedules and identify the cause of the blow-up as an NP-hard problem. Our main contribution is a new approach, called Quasi-Optimal POR, that can arbitrarily approximate a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03950","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":""},"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":"1802.03950","created_at":"2026-05-18T00:17:59.598948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03950v3","created_at":"2026-05-18T00:17:59.598948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03950","created_at":"2026-05-18T00:17:59.598948+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWSJ5YLF4KR3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWSJ5YLF4KR3AVNO","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWSJ5YLF","created_at":"2026-05-18T12:32:37.024351+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/LWSJ5YLF4KR3AVNOD74UV4CBHG","json":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG.json","graph_json":"https://pith.science/api/pith-number/LWSJ5YLF4KR3AVNOD74UV4CBHG/graph.json","events_json":"https://pith.science/api/pith-number/LWSJ5YLF4KR3AVNOD74UV4CBHG/events.json","paper":"https://pith.science/paper/LWSJ5YLF"},"agent_actions":{"view_html":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG","download_json":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG.json","view_paper":"https://pith.science/paper/LWSJ5YLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03950&json=true","fetch_graph":"https://pith.science/api/pith-number/LWSJ5YLF4KR3AVNOD74UV4CBHG/graph.json","fetch_events":"https://pith.science/api/pith-number/LWSJ5YLF4KR3AVNOD74UV4CBHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/action/storage_attestation","attest_author":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/action/author_attestation","sign_citation":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/action/citation_signature","submit_replication":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/action/replication_record"}},"created_at":"2026-05-18T00:17:59.598948+00:00","updated_at":"2026-05-18T00:17:59.598948+00:00"}