{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SJ235UFLW7LA2ISEZPZLJGUQY3","short_pith_number":"pith:SJ235UFL","schema_version":"1.0","canonical_sha256":"9275bed0abb7d60d2244cbf2b49a90c6e1d4a5c49dad00c6103b279f16949840","source":{"kind":"arxiv","id":"2106.14805","version":1},"attestation_state":"computed","paper":{"title":"Experimental Comparison of PC-Trees and PQ-Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ignaz Rutter, Matthias Pfretzschner, Simon D. Fink","submitted_at":"2021-06-28T15:28:57Z","abstract_excerpt":"PQ-trees and PC-trees are data structures that represent sets of linear and circular orders, respectively, subject to constraints that specific subsets of elements have to be consecutive. While equivalent to each other, PC-trees are conceptually much simpler than PQ-trees; updating a PC-trees so that a set of elements becomes consecutive requires only a single operation, whereas PQ-trees use an update procedure that is described in terms of nine transformation templates that have to be recursively matched and applied.\n  Despite these theoretical advantages, to date no practical PC-tree impleme"},"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":"2106.14805","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-06-28T15:28:57Z","cross_cats_sorted":[],"title_canon_sha256":"274c97486281d96f62c3f6960db05aee46b1d10277c2c4965bd8f439f75b8c51","abstract_canon_sha256":"3cb0b4329643a9e8cc01d472d30d9f5ec43f5c8fd61e17fcb72248dcda5ca5db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:54.072294Z","signature_b64":"+Dtqj0P2HAiQgOH0ho5yBknGZFhzPu2TjzcZtNBKmsN1iPPgM5vy/TzF8X49IsK9SaNhL15W8rsDXLgx21YjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9275bed0abb7d60d2244cbf2b49a90c6e1d4a5c49dad00c6103b279f16949840","last_reissued_at":"2026-07-05T02:52:54.071881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:54.071881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Experimental Comparison of PC-Trees and PQ-Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ignaz Rutter, Matthias Pfretzschner, Simon D. Fink","submitted_at":"2021-06-28T15:28:57Z","abstract_excerpt":"PQ-trees and PC-trees are data structures that represent sets of linear and circular orders, respectively, subject to constraints that specific subsets of elements have to be consecutive. While equivalent to each other, PC-trees are conceptually much simpler than PQ-trees; updating a PC-trees so that a set of elements becomes consecutive requires only a single operation, whereas PQ-trees use an update procedure that is described in terms of nine transformation templates that have to be recursively matched and applied.\n  Despite these theoretical advantages, to date no practical PC-tree impleme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14805","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.14805/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":"2106.14805","created_at":"2026-07-05T02:52:54.071939+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.14805v1","created_at":"2026-07-05T02:52:54.071939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14805","created_at":"2026-07-05T02:52:54.071939+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJ235UFLW7LA","created_at":"2026-07-05T02:52:54.071939+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJ235UFLW7LA2ISE","created_at":"2026-07-05T02:52:54.071939+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJ235UFL","created_at":"2026-07-05T02:52:54.071939+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/SJ235UFLW7LA2ISEZPZLJGUQY3","json":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3.json","graph_json":"https://pith.science/api/pith-number/SJ235UFLW7LA2ISEZPZLJGUQY3/graph.json","events_json":"https://pith.science/api/pith-number/SJ235UFLW7LA2ISEZPZLJGUQY3/events.json","paper":"https://pith.science/paper/SJ235UFL"},"agent_actions":{"view_html":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3","download_json":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3.json","view_paper":"https://pith.science/paper/SJ235UFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.14805&json=true","fetch_graph":"https://pith.science/api/pith-number/SJ235UFLW7LA2ISEZPZLJGUQY3/graph.json","fetch_events":"https://pith.science/api/pith-number/SJ235UFLW7LA2ISEZPZLJGUQY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/action/storage_attestation","attest_author":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/action/author_attestation","sign_citation":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/action/citation_signature","submit_replication":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/action/replication_record"}},"created_at":"2026-07-05T02:52:54.071939+00:00","updated_at":"2026-07-05T02:52:54.071939+00:00"}