{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7VL4FHJBN5ZWK2VSUIO7JM6GPJ","short_pith_number":"pith:7VL4FHJB","schema_version":"1.0","canonical_sha256":"fd57c29d216f73656ab2a21df4b3c67a4cb13bb1d0aca7b4177f6886c0fab7c7","source":{"kind":"arxiv","id":"2208.07800","version":2},"attestation_state":"computed","paper":{"title":"New Concurrent Order Maintenance Data Structure","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bin Guo, Emil Sekerinski","submitted_at":"2022-08-16T15:30:22Z","abstract_excerpt":"The \\emph{Order-Maintenance} (OM) data structure maintains a total order list of items for insertions, deletions, and comparisons. As a basic data structure, OM has many applications, such as maintaining the topological order, core numbers, and truss in graphs, and maintaining ordered sets in Unified Modeling Language (UML) Specification. The prevalence of multicore machines suggests parallelizing such a basic data structure. This paper proposes a new parallel OM data structure that supports insertions, deletions, and comparisons in parallel. Specifically, parallel insertions and deletions are"},"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":"2208.07800","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-16T15:30:22Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"866c4e3d9ef5e61a1c8eb846f1d7d4f336f484912746de90ff76f6bdf4784814","abstract_canon_sha256":"bad6d19f160f7f9f0e7b1c9e81d7662066e2489e2fc6ac3d7fd460943ee50bef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:22.296097Z","signature_b64":"9IyxUh31+MqjF5YcDyZU/r7VvReSL9gPiaMEzWDWeRl2CIvlWdorzT3VpDICbs3d45LRgGR+j5dAXvpyZUNgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd57c29d216f73656ab2a21df4b3c67a4cb13bb1d0aca7b4177f6886c0fab7c7","last_reissued_at":"2026-07-05T09:19:22.295613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:22.295613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Concurrent Order Maintenance Data Structure","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bin Guo, Emil Sekerinski","submitted_at":"2022-08-16T15:30:22Z","abstract_excerpt":"The \\emph{Order-Maintenance} (OM) data structure maintains a total order list of items for insertions, deletions, and comparisons. As a basic data structure, OM has many applications, such as maintaining the topological order, core numbers, and truss in graphs, and maintaining ordered sets in Unified Modeling Language (UML) Specification. The prevalence of multicore machines suggests parallelizing such a basic data structure. This paper proposes a new parallel OM data structure that supports insertions, deletions, and comparisons in parallel. Specifically, parallel insertions and deletions are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07800","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.07800/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":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":"2208.07800","created_at":"2026-07-05T09:19:22.295671+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.07800v2","created_at":"2026-07-05T09:19:22.295671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07800","created_at":"2026-07-05T09:19:22.295671+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VL4FHJBN5ZW","created_at":"2026-07-05T09:19:22.295671+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VL4FHJBN5ZWK2VS","created_at":"2026-07-05T09:19:22.295671+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VL4FHJB","created_at":"2026-07-05T09:19:22.295671+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/7VL4FHJBN5ZWK2VSUIO7JM6GPJ","json":"https://pith.science/pith/7VL4FHJBN5ZWK2VSUIO7JM6GPJ.json","graph_json":"https://pith.science/api/pith-number/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/graph.json","events_json":"https://pith.science/api/pith-number/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/events.json","paper":"https://pith.science/paper/7VL4FHJB"},"agent_actions":{"view_html":"https://pith.science/pith/7VL4FHJBN5ZWK2VSUIO7JM6GPJ","download_json":"https://pith.science/pith/7VL4FHJBN5ZWK2VSUIO7JM6GPJ.json","view_paper":"https://pith.science/paper/7VL4FHJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.07800&json=true","fetch_graph":"https://pith.science/api/pith-number/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/action/storage_attestation","attest_author":"https://pith.science/pith/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/action/author_attestation","sign_citation":"https://pith.science/pith/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/action/citation_signature","submit_replication":"https://pith.science/pith/7VL4FHJBN5ZWK2VSUIO7JM6GPJ/action/replication_record"}},"created_at":"2026-07-05T09:19:22.295671+00:00","updated_at":"2026-07-05T09:19:22.295671+00:00"}