{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SJ235UFLW7LA2ISEZPZLJGUQY3","short_pith_number":"pith:SJ235UFL","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"},"canonical_sha256":"9275bed0abb7d60d2244cbf2b49a90c6e1d4a5c49dad00c6103b279f16949840","source":{"kind":"arxiv","id":"2106.14805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.14805","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"2106.14805v1","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14805","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"SJ235UFLW7LA","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_16","alias_value":"SJ235UFLW7LA2ISE","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_8","alias_value":"SJ235UFL","created_at":"2026-07-05T02:52:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SJ235UFLW7LA2ISEZPZLJGUQY3","target":"record","payload":{"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"},"canonical_sha256":"9275bed0abb7d60d2244cbf2b49a90c6e1d4a5c49dad00c6103b279f16949840","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"},"source_kind":"arxiv","source_id":"2106.14805","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vwfOtQxqOELc3xSK+koxzTo0zOkLAYgHJyO/kOl/X9n1NvBoIqbAU0zEn7KWOwjAZ17bB8pUxT1QpleSa7+pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:18:15.432239Z"},"content_sha256":"e63e499f306d16aba6b1da53ec6112db3f07ab63e40c04b6b43f3608bfd9759f","schema_version":"1.0","event_id":"sha256:e63e499f306d16aba6b1da53ec6112db3f07ab63e40c04b6b43f3608bfd9759f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SJ235UFLW7LA2ISEZPZLJGUQY3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mM2FIj7qtrY+WlVQxCcLgWhu9psEM6f9DmmzY8Urz4Holn6CdT/ykvpFBWHU1rhOxIRRf+aZiqCVFfcGyot9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:18:15.433345Z"},"content_sha256":"ebe15e27250682645d75e8bb9d4c9b398d67bb19b68dcc40ace6c47a2c05171e","schema_version":"1.0","event_id":"sha256:ebe15e27250682645d75e8bb9d4c9b398d67bb19b68dcc40ace6c47a2c05171e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/bundle.json","state_url":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T18:18:15Z","links":{"resolver":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3","bundle":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/bundle.json","state":"https://pith.science/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJ235UFLW7LA2ISEZPZLJGUQY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SJ235UFLW7LA2ISEZPZLJGUQY3","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":"3cb0b4329643a9e8cc01d472d30d9f5ec43f5c8fd61e17fcb72248dcda5ca5db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-06-28T15:28:57Z","title_canon_sha256":"274c97486281d96f62c3f6960db05aee46b1d10277c2c4965bd8f439f75b8c51"},"schema_version":"1.0","source":{"id":"2106.14805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.14805","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"2106.14805v1","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14805","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"SJ235UFLW7LA","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_16","alias_value":"SJ235UFLW7LA2ISE","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_8","alias_value":"SJ235UFL","created_at":"2026-07-05T02:52:54Z"}],"graph_snapshots":[{"event_id":"sha256:ebe15e27250682645d75e8bb9d4c9b398d67bb19b68dcc40ace6c47a2c05171e","target":"graph","created_at":"2026-07-05T02:52:54Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.14805/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ignaz Rutter, Matthias Pfretzschner, Simon D. Fink","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-06-28T15:28:57Z","title":"Experimental Comparison of PC-Trees and PQ-Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14805","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e63e499f306d16aba6b1da53ec6112db3f07ab63e40c04b6b43f3608bfd9759f","target":"record","created_at":"2026-07-05T02:52:54Z","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":"3cb0b4329643a9e8cc01d472d30d9f5ec43f5c8fd61e17fcb72248dcda5ca5db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-06-28T15:28:57Z","title_canon_sha256":"274c97486281d96f62c3f6960db05aee46b1d10277c2c4965bd8f439f75b8c51"},"schema_version":"1.0","source":{"id":"2106.14805","kind":"arxiv","version":1}},"canonical_sha256":"9275bed0abb7d60d2244cbf2b49a90c6e1d4a5c49dad00c6103b279f16949840","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9275bed0abb7d60d2244cbf2b49a90c6e1d4a5c49dad00c6103b279f16949840","first_computed_at":"2026-07-05T02:52:54.071881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:52:54.071881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Dtqj0P2HAiQgOH0ho5yBknGZFhzPu2TjzcZtNBKmsN1iPPgM5vy/TzF8X49IsK9SaNhL15W8rsDXLgx21YjDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:52:54.072294Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.14805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e63e499f306d16aba6b1da53ec6112db3f07ab63e40c04b6b43f3608bfd9759f","sha256:ebe15e27250682645d75e8bb9d4c9b398d67bb19b68dcc40ace6c47a2c05171e"],"state_sha256":"13d3d6c402f49d6e1ff6264be89a3d42be7c1b747971da7a06177cca95eda26f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMNyivNmnaqlpOd9PImWoBjjzCD1Gf6Y2/mNdeUreKYiz5Tz2c3dDIf5RAy4BmoKlEneVnahWAMP5h9tk9G/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T18:18:15.438716Z","bundle_sha256":"f3c695496ab3c632ee2518d9e339243797a9a0b7ae518fcab6c21ca99bc30134"}}