{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NDTOVTRG3DALZDXA5QNZZKM4MN","short_pith_number":"pith:NDTOVTRG","schema_version":"1.0","canonical_sha256":"68e6eace26d8c0bc8ee0ec1b9ca99c636e065c64c47715c654fa9f82df4ae818","source":{"kind":"arxiv","id":"1408.0957","version":1},"attestation_state":"computed","paper":{"title":"A Framework to Synergize Partial Order Reduction with State Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Duc-Hiep Chu, Joxan Jaffar","submitted_at":"2014-08-05T13:27:09Z","abstract_excerpt":"We address the problem of reasoning about interleavings in safety verification of concurrent programs. In the literature, there are two prominent techniques for pruning the search space. First, there are well-investigated trace-based methods, collectively known as \"Partial Order Reduction (POR)\", which operate by weakening the concept of a trace by abstracting the total order of its transitions into a partial order. Second, there is state-based interpolation where a collection of formulas can be generalized by taking into account the property to be verified. Our main contribution is a framewor"},"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":"1408.0957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-08-05T13:27:09Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"0d2e820ea2368a07ca3908f40a040669f9bcd38e269006ca221447e3cb4e7ab1","abstract_canon_sha256":"cc45016c52dde8d9b859228e5f1758b17c6540c56737874c2c214921d8e09486"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:50.101957Z","signature_b64":"bZPR7bMbt+PmWzVsBDPsFbcKKA/svOl74Nuzaeg3FJsnghe2sp1z5twyy+Ih8+qHUJ+ABxiZkKFCpeUDanQMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e6eace26d8c0bc8ee0ec1b9ca99c636e065c64c47715c654fa9f82df4ae818","last_reissued_at":"2026-05-18T02:45:50.101467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:50.101467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework to Synergize Partial Order Reduction with State Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Duc-Hiep Chu, Joxan Jaffar","submitted_at":"2014-08-05T13:27:09Z","abstract_excerpt":"We address the problem of reasoning about interleavings in safety verification of concurrent programs. In the literature, there are two prominent techniques for pruning the search space. First, there are well-investigated trace-based methods, collectively known as \"Partial Order Reduction (POR)\", which operate by weakening the concept of a trace by abstracting the total order of its transitions into a partial order. Second, there is state-based interpolation where a collection of formulas can be generalized by taking into account the property to be verified. Our main contribution is a framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0957","kind":"arxiv","version":1},"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":"1408.0957","created_at":"2026-05-18T02:45:50.101560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0957v1","created_at":"2026-05-18T02:45:50.101560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0957","created_at":"2026-05-18T02:45:50.101560+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDTOVTRG3DAL","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDTOVTRG3DALZDXA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDTOVTRG","created_at":"2026-05-18T12:28:41.024544+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/NDTOVTRG3DALZDXA5QNZZKM4MN","json":"https://pith.science/pith/NDTOVTRG3DALZDXA5QNZZKM4MN.json","graph_json":"https://pith.science/api/pith-number/NDTOVTRG3DALZDXA5QNZZKM4MN/graph.json","events_json":"https://pith.science/api/pith-number/NDTOVTRG3DALZDXA5QNZZKM4MN/events.json","paper":"https://pith.science/paper/NDTOVTRG"},"agent_actions":{"view_html":"https://pith.science/pith/NDTOVTRG3DALZDXA5QNZZKM4MN","download_json":"https://pith.science/pith/NDTOVTRG3DALZDXA5QNZZKM4MN.json","view_paper":"https://pith.science/paper/NDTOVTRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0957&json=true","fetch_graph":"https://pith.science/api/pith-number/NDTOVTRG3DALZDXA5QNZZKM4MN/graph.json","fetch_events":"https://pith.science/api/pith-number/NDTOVTRG3DALZDXA5QNZZKM4MN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDTOVTRG3DALZDXA5QNZZKM4MN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDTOVTRG3DALZDXA5QNZZKM4MN/action/storage_attestation","attest_author":"https://pith.science/pith/NDTOVTRG3DALZDXA5QNZZKM4MN/action/author_attestation","sign_citation":"https://pith.science/pith/NDTOVTRG3DALZDXA5QNZZKM4MN/action/citation_signature","submit_replication":"https://pith.science/pith/NDTOVTRG3DALZDXA5QNZZKM4MN/action/replication_record"}},"created_at":"2026-05-18T02:45:50.101560+00:00","updated_at":"2026-05-18T02:45:50.101560+00:00"}