{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LWSJ5YLF4KR3AVNOD74UV4CBHG","short_pith_number":"pith:LWSJ5YLF","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"},"canonical_sha256":"5da49ee165e2a3b055ae1ff94af041398f66b739462ee5ba3dce7e5f7a8794e3","source":{"kind":"arxiv","id":"1802.03950","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03950","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03950v3","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03950","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"LWSJ5YLF4KR3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LWSJ5YLF4KR3AVNO","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LWSJ5YLF","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LWSJ5YLF4KR3AVNOD74UV4CBHG","target":"record","payload":{"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"},"canonical_sha256":"5da49ee165e2a3b055ae1ff94af041398f66b739462ee5ba3dce7e5f7a8794e3","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"},"source_kind":"arxiv","source_id":"1802.03950","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-05-18T00:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQUWm11S3bqlOkeqSSSPcmPvpzEA5X+g1JDXNN7GdNpNpuNUiB+ku2Q1aYfXQnUF5K51aoVmGpFxtNlWSiihAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:07:43.102342Z"},"content_sha256":"80b0a8bb337ab2b870fec784eecf66b8a7af1155358d93a5c554ab8220dc865c","schema_version":"1.0","event_id":"sha256:80b0a8bb337ab2b870fec784eecf66b8a7af1155358d93a5c554ab8220dc865c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LWSJ5YLF4KR3AVNOD74UV4CBHG","target":"graph","payload":{"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"},"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:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsg99q7I3UI792VapbEIrAssWo80rd1SbqntMVmztJ+lLce4Lgn586bGaDcKlDAQ3x2xEKNY96eNB1VmgaLuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:07:43.102903Z"},"content_sha256":"de05c11549ac080110fc2d2368cc6f49720d1977e9a35aa8264ecdbdca4807f4","schema_version":"1.0","event_id":"sha256:de05c11549ac080110fc2d2368cc6f49720d1977e9a35aa8264ecdbdca4807f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/bundle.json","state_url":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/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-26T18:07:43Z","links":{"resolver":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG","bundle":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/bundle.json","state":"https://pith.science/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWSJ5YLF4KR3AVNOD74UV4CBHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LWSJ5YLF4KR3AVNOD74UV4CBHG","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":"fb67ed63320a6c73039194468a9a31c64ad5a41a20a24f7563d7ea1c91011331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-12T09:55:20Z","title_canon_sha256":"fbb5025823b1b8b795ab3f9b8bdb2053434c61ba21782dd08f822db12a2e0879"},"schema_version":"1.0","source":{"id":"1802.03950","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03950","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03950v3","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03950","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"LWSJ5YLF4KR3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LWSJ5YLF4KR3AVNO","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LWSJ5YLF","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:de05c11549ac080110fc2d2368cc6f49720d1977e9a35aa8264ecdbdca4807f4","target":"graph","created_at":"2026-05-18T00:17:59Z","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":"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","authors_text":"Camille Coti, C\\'esar Rodr\\'iguez, Huyen T.T Nguyen, Laure Petrucci, Marcelo Sousa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-12T09:55:20Z","title":"Quasi-Optimal Partial Order Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03950","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:80b0a8bb337ab2b870fec784eecf66b8a7af1155358d93a5c554ab8220dc865c","target":"record","created_at":"2026-05-18T00:17:59Z","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":"fb67ed63320a6c73039194468a9a31c64ad5a41a20a24f7563d7ea1c91011331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-12T09:55:20Z","title_canon_sha256":"fbb5025823b1b8b795ab3f9b8bdb2053434c61ba21782dd08f822db12a2e0879"},"schema_version":"1.0","source":{"id":"1802.03950","kind":"arxiv","version":3}},"canonical_sha256":"5da49ee165e2a3b055ae1ff94af041398f66b739462ee5ba3dce7e5f7a8794e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5da49ee165e2a3b055ae1ff94af041398f66b739462ee5ba3dce7e5f7a8794e3","first_computed_at":"2026-05-18T00:17:59.598880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:59.598880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UNSASqgEBZf3w8wyNXe1/cEc90IgpDjEgXXoB9qGWPUrY6tEXm5iZPwtksDxpcptCXkGtyrXJB9nylEvObkgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:59.599378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03950","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80b0a8bb337ab2b870fec784eecf66b8a7af1155358d93a5c554ab8220dc865c","sha256:de05c11549ac080110fc2d2368cc6f49720d1977e9a35aa8264ecdbdca4807f4"],"state_sha256":"1786c80743459c43136d0b30dc4c8e5b3f53bf46a0145d8882616aeb040c8f7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydJtwsszRheAzUvuNbT68ikDlV/UkphOETqO57wAXnzUTFYlSuFVgj3z2/2IgYuqq7c/zNWGK3+56pNvmlUuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:07:43.106184Z","bundle_sha256":"e77f26c9e9cbf02336d4ebd6efd134ed08d4911e82f6e48544ccf29996176df6"}}