{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:44YZH6MAHXVGYQJ2PJWGA3VGFO","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":"43a70e63ab6a359bafd3233d068522dff4ed39a9e4e303b479ae9bef114c81aa","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-09-06T04:18:43Z","title_canon_sha256":"cd53e8b5e56d93e1365cb7aa88531f20f46b199c7480384f29ff9704f8953a3e"},"schema_version":"1.0","source":{"id":"2509.05586","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.05586","created_at":"2026-05-26T01:03:15Z"},{"alias_kind":"arxiv_version","alias_value":"2509.05586v4","created_at":"2026-05-26T01:03:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05586","created_at":"2026-05-26T01:03:15Z"},{"alias_kind":"pith_short_12","alias_value":"44YZH6MAHXVG","created_at":"2026-05-26T01:03:15Z"},{"alias_kind":"pith_short_16","alias_value":"44YZH6MAHXVGYQJ2","created_at":"2026-05-26T01:03:15Z"},{"alias_kind":"pith_short_8","alias_value":"44YZH6MA","created_at":"2026-05-26T01:03:15Z"}],"graph_snapshots":[{"event_id":"sha256:83e66a1aee467f2ef5b22f78143d7cfb9359469f1d3123a1a60174625f6cf38e","target":"graph","created_at":"2026-05-26T01:03:15Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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))."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Linearizability monitoring for stacks, queues, and maps is fixed-parameter tractable in the number of processes."}],"snapshot_sha256":"1ef69e8fde7e602dbe3502a65c41095b3f485bf1bd77891783a90c8d551b4eea"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"675989aca46bd5ac139b84829a94b5d8502a17bdfce54b7c236428c6a1d34e48"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.05586/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 -","authors_text":"Lee Zheng Han, Umang Mathur","cross_cats":["cs.CC"],"headline":"Linearizability monitoring for stacks, queues, and maps is fixed-parameter tractable in the number of processes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-09-06T04:18:43Z","title":"Fixed Parameter Tractable Linearizability Monitoring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.05586","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-18T18:52:31.559968Z","id":"62acc288-81c9-43f5-aa7c-52ab94293e11","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Linearizability monitoring for stacks, queues, and maps is fixed-parameter tractable in the number of processes.","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)).","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)."}},"verdict_id":"62acc288-81c9-43f5-aa7c-52ab94293e11"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:48a01d58854ba4d0dc4457a74fdc6ca75205f52f677c47d650dbf46bd407d954","target":"record","created_at":"2026-05-26T01:03:15Z","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":"43a70e63ab6a359bafd3233d068522dff4ed39a9e4e303b479ae9bef114c81aa","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-09-06T04:18:43Z","title_canon_sha256":"cd53e8b5e56d93e1365cb7aa88531f20f46b199c7480384f29ff9704f8953a3e"},"schema_version":"1.0","source":{"id":"2509.05586","kind":"arxiv","version":4}},"canonical_sha256":"e73193f9803dea6c413a7a6c606ea62bb619e4d9b156b3f2aff8c4e06cda86ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e73193f9803dea6c413a7a6c606ea62bb619e4d9b156b3f2aff8c4e06cda86ab","first_computed_at":"2026-05-26T01:03:15.190508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:15.190508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRkah4lBDbPb1371VGotywqlkutWny78x16kncj4f8dP/IYeXULMdAl/kMLuZuQGqulitU9JILbKI7tsp9LLAw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:15.191122Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.05586","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a01d58854ba4d0dc4457a74fdc6ca75205f52f677c47d650dbf46bd407d954","sha256:83e66a1aee467f2ef5b22f78143d7cfb9359469f1d3123a1a60174625f6cf38e"],"state_sha256":"6d6593c948adb9e90aea3329053b45f631b6d4c146a174677f43856639b96ee7"}