{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:44YZH6MAHXVGYQJ2PJWGA3VGFO","short_pith_number":"pith:44YZH6MA","schema_version":"1.0","canonical_sha256":"e73193f9803dea6c413a7a6c606ea62bb619e4d9b156b3f2aff8c4e06cda86ab","source":{"kind":"arxiv","id":"2509.05586","version":4},"attestation_state":"computed","paper":{"title":"Fixed Parameter Tractable Linearizability Monitoring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Linearizability monitoring for stacks, queues, and maps is fixed-parameter tractable in the number of processes.","cross_cats":["cs.CC"],"primary_cat":"cs.PL","authors_text":"Lee Zheng Han, Umang Mathur","submitted_at":"2025-09-06T04:18:43Z","abstract_excerpt":"We study the linearizability monitoring problem, which asks whether a given concurrent history of a data structure is equivalent to some sequential execution of the same data structure. In general, this problem is $\\textsf{NP}$-hard, even for simple objects such as registers. Recent work has identified tractable cases for restricted classes of histories, notably unambiguous and differentiated histories.\n  We revisit the tractability boundary from a fine-grained, parameterized perspective. We show that for a broad class of data structures -- including stacks, queues, priority queues, and maps -"},"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":true},"canonical_record":{"source":{"id":"2509.05586","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-09-06T04:18:43Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cd53e8b5e56d93e1365cb7aa88531f20f46b199c7480384f29ff9704f8953a3e","abstract_canon_sha256":"43a70e63ab6a359bafd3233d068522dff4ed39a9e4e303b479ae9bef114c81aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:15.191122Z","signature_b64":"GRkah4lBDbPb1371VGotywqlkutWny78x16kncj4f8dP/IYeXULMdAl/kMLuZuQGqulitU9JILbKI7tsp9LLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e73193f9803dea6c413a7a6c606ea62bb619e4d9b156b3f2aff8c4e06cda86ab","last_reissued_at":"2026-05-26T01:03:15.190508Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:15.190508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed Parameter Tractable Linearizability Monitoring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Linearizability monitoring for stacks, queues, and maps is fixed-parameter tractable in the number of processes.","cross_cats":["cs.CC"],"primary_cat":"cs.PL","authors_text":"Lee Zheng Han, Umang Mathur","submitted_at":"2025-09-06T04:18:43Z","abstract_excerpt":"We study the linearizability monitoring problem, which asks whether a given concurrent history of a data structure is equivalent to some sequential execution of the same data structure. In general, this problem is $\\textsf{NP}$-hard, even for simple objects such as registers. Recent work has identified tractable cases for restricted classes of histories, notably unambiguous and differentiated histories.\n  We revisit the tractability boundary from a fine-grained, parameterized perspective. We show that for a broad class of data structures -- including stacks, queues, priority queues, and maps -"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that for a broad class of data structures -- including stacks, queues, priority queues, and maps -- linearizability monitoring is fixed-parameter tractable when parameterized by the number of processes. Concretely, we give an algorithm running in time O(c^k · poly(n)).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The sequential specifications of the considered data structures can be captured by fixed languages L for which language reachability is efficiently solvable on the specific graph structures induced by concurrent histories (as stated in the reduction to language reachability).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Linearizability monitoring for stacks, queues, priority queues, and maps is fixed-parameter tractable parameterized by the number of processes via reduction to language reachability on history-induced graphs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Linearizability monitoring for stacks, queues, and maps is fixed-parameter tractable in the number of processes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1ef69e8fde7e602dbe3502a65c41095b3f485bf1bd77891783a90c8d551b4eea"},"source":{"id":"2509.05586","kind":"arxiv","version":4},"verdict":{"id":"62acc288-81c9-43f5-aa7c-52ab94293e11","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T18:52:31.559968Z","strongest_claim":"We show that for a broad class of data structures -- including stacks, queues, priority queues, and maps -- linearizability monitoring is fixed-parameter tractable when parameterized by the number of processes. Concretely, we give an algorithm running in time O(c^k · poly(n)).","one_line_summary":"Linearizability monitoring for stacks, queues, priority queues, and maps is fixed-parameter tractable parameterized by the number of processes via reduction to language reachability on history-induced graphs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The sequential specifications of the considered data structures can be captured by fixed languages L for which language reachability is efficiently solvable on the specific graph structures induced by concurrent histories (as stated in the reduction to language reachability).","pith_extraction_headline":"Linearizability monitoring for stacks, queues, and maps is fixed-parameter tractable in the number of processes."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.05586/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":2,"snapshot_sha256":"675989aca46bd5ac139b84829a94b5d8502a17bdfce54b7c236428c6a1d34e48"},"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":"2509.05586","created_at":"2026-05-26T01:03:15.190589+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.05586v4","created_at":"2026-05-26T01:03:15.190589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05586","created_at":"2026-05-26T01:03:15.190589+00:00"},{"alias_kind":"pith_short_12","alias_value":"44YZH6MAHXVG","created_at":"2026-05-26T01:03:15.190589+00:00"},{"alias_kind":"pith_short_16","alias_value":"44YZH6MAHXVGYQJ2","created_at":"2026-05-26T01:03:15.190589+00:00"},{"alias_kind":"pith_short_8","alias_value":"44YZH6MA","created_at":"2026-05-26T01:03:15.190589+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO","json":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO.json","graph_json":"https://pith.science/api/pith-number/44YZH6MAHXVGYQJ2PJWGA3VGFO/graph.json","events_json":"https://pith.science/api/pith-number/44YZH6MAHXVGYQJ2PJWGA3VGFO/events.json","paper":"https://pith.science/paper/44YZH6MA"},"agent_actions":{"view_html":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO","download_json":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO.json","view_paper":"https://pith.science/paper/44YZH6MA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.05586&json=true","fetch_graph":"https://pith.science/api/pith-number/44YZH6MAHXVGYQJ2PJWGA3VGFO/graph.json","fetch_events":"https://pith.science/api/pith-number/44YZH6MAHXVGYQJ2PJWGA3VGFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO/action/storage_attestation","attest_author":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO/action/author_attestation","sign_citation":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO/action/citation_signature","submit_replication":"https://pith.science/pith/44YZH6MAHXVGYQJ2PJWGA3VGFO/action/replication_record"}},"created_at":"2026-05-26T01:03:15.190589+00:00","updated_at":"2026-05-26T01:03:15.190589+00:00"}