{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z32FVSZ3OFR7OMWYTHX22CUXE5","short_pith_number":"pith:Z32FVSZ3","canonical_record":{"source":{"id":"1705.00415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-01T03:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"b5ca48c96c10a2b5a54c00155060d5dd448286a4319b3dea60d1b0a695bc8b89","abstract_canon_sha256":"d500868b9fe2cd10313a9751e102cd9f530526beb6fca6301506b30e39809f26"},"schema_version":"1.0"},"canonical_sha256":"cef45acb3b7163f732d899efad0a97276a22042f7ff84192d2d4c78859aba818","source":{"kind":"arxiv","id":"1705.00415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00415","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00415v1","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00415","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"pith_short_12","alias_value":"Z32FVSZ3OFR7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z32FVSZ3OFR7OMWY","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z32FVSZ3","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z32FVSZ3OFR7OMWYTHX22CUXE5","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-01T03:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"b5ca48c96c10a2b5a54c00155060d5dd448286a4319b3dea60d1b0a695bc8b89","abstract_canon_sha256":"d500868b9fe2cd10313a9751e102cd9f530526beb6fca6301506b30e39809f26"},"schema_version":"1.0"},"canonical_sha256":"cef45acb3b7163f732d899efad0a97276a22042f7ff84192d2d4c78859aba818","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:17.318405Z","signature_b64":"9Pe5ajSoycNkIoRhoaFfcmqolPDQH3CfNh4ktKNSqUDauE1h8K223DlzHPnhL5s4M0ZXDtEnkc6spZ+aLJoXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cef45acb3b7163f732d899efad0a97276a22042f7ff84192d2d4c78859aba818","last_reissued_at":"2026-05-18T00:45:17.317681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:17.317681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00415","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-05-18T00:45:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MzwcsxQOtrMZ4mpy57aMNXQkdlr+Mk0HHyanqei1nzjoNcxBtozXdPXPBbRKaF0Je+gmOgEYpyFB/b93EEaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:03:29.556569Z"},"content_sha256":"db8e785313db837887a26c1defe5dc12e04bba934f1fdc28143cd99d96251b40","schema_version":"1.0","event_id":"sha256:db8e785313db837887a26c1defe5dc12e04bba934f1fdc28143cd99d96251b40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z32FVSZ3OFR7OMWYTHX22CUXE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Construction of Compact Planar Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Jos\\'e Fuentes-Sep\\'ulveda, Leo Ferres, Meng He, Travis Gagie","submitted_at":"2017-05-01T03:50:09Z","abstract_excerpt":"The sheer sizes of modern datasets are forcing data-structure designers to consider seriously both parallel construction and compactness. To achieve those goals we need to design a parallel algorithm with good scalability and with low memory consumption. An algorithm with good scalability improves its performance when the number of available cores increases, and an algorithm with low memory consumption uses memory proportional to the space used by the dataset in uncompact form. In this work, we discuss the engineering of a parallel algorithm with linear work and logarithmic span for the constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00415","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":""},"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-05-18T00:45:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVE0Fa5nNbJsN7bLhcRyG1pynKb+5V3K6TYuGwaLrnp3/J6zrkiWEm1/tXbh3FmAASLnn/jc27fSyToiDdyWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:03:29.556951Z"},"content_sha256":"2b10c545b220add7bec8eeda0a83d03cdeab2a972fa8f3b2cfb60bbc83c9c313","schema_version":"1.0","event_id":"sha256:2b10c545b220add7bec8eeda0a83d03cdeab2a972fa8f3b2cfb60bbc83c9c313"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z32FVSZ3OFR7OMWYTHX22CUXE5/bundle.json","state_url":"https://pith.science/pith/Z32FVSZ3OFR7OMWYTHX22CUXE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z32FVSZ3OFR7OMWYTHX22CUXE5/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-05-26T20:03:29Z","links":{"resolver":"https://pith.science/pith/Z32FVSZ3OFR7OMWYTHX22CUXE5","bundle":"https://pith.science/pith/Z32FVSZ3OFR7OMWYTHX22CUXE5/bundle.json","state":"https://pith.science/pith/Z32FVSZ3OFR7OMWYTHX22CUXE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z32FVSZ3OFR7OMWYTHX22CUXE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z32FVSZ3OFR7OMWYTHX22CUXE5","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":"d500868b9fe2cd10313a9751e102cd9f530526beb6fca6301506b30e39809f26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-01T03:50:09Z","title_canon_sha256":"b5ca48c96c10a2b5a54c00155060d5dd448286a4319b3dea60d1b0a695bc8b89"},"schema_version":"1.0","source":{"id":"1705.00415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00415","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00415v1","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00415","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"pith_short_12","alias_value":"Z32FVSZ3OFR7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z32FVSZ3OFR7OMWY","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z32FVSZ3","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:2b10c545b220add7bec8eeda0a83d03cdeab2a972fa8f3b2cfb60bbc83c9c313","target":"graph","created_at":"2026-05-18T00:45:17Z","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"},"paper":{"abstract_excerpt":"The sheer sizes of modern datasets are forcing data-structure designers to consider seriously both parallel construction and compactness. To achieve those goals we need to design a parallel algorithm with good scalability and with low memory consumption. An algorithm with good scalability improves its performance when the number of available cores increases, and an algorithm with low memory consumption uses memory proportional to the space used by the dataset in uncompact form. In this work, we discuss the engineering of a parallel algorithm with linear work and logarithmic span for the constr","authors_text":"Gonzalo Navarro, Jos\\'e Fuentes-Sep\\'ulveda, Leo Ferres, Meng He, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-01T03:50:09Z","title":"Parallel Construction of Compact Planar Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00415","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:db8e785313db837887a26c1defe5dc12e04bba934f1fdc28143cd99d96251b40","target":"record","created_at":"2026-05-18T00:45:17Z","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":"d500868b9fe2cd10313a9751e102cd9f530526beb6fca6301506b30e39809f26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-01T03:50:09Z","title_canon_sha256":"b5ca48c96c10a2b5a54c00155060d5dd448286a4319b3dea60d1b0a695bc8b89"},"schema_version":"1.0","source":{"id":"1705.00415","kind":"arxiv","version":1}},"canonical_sha256":"cef45acb3b7163f732d899efad0a97276a22042f7ff84192d2d4c78859aba818","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cef45acb3b7163f732d899efad0a97276a22042f7ff84192d2d4c78859aba818","first_computed_at":"2026-05-18T00:45:17.317681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:17.317681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Pe5ajSoycNkIoRhoaFfcmqolPDQH3CfNh4ktKNSqUDauE1h8K223DlzHPnhL5s4M0ZXDtEnkc6spZ+aLJoXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:17.318405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db8e785313db837887a26c1defe5dc12e04bba934f1fdc28143cd99d96251b40","sha256:2b10c545b220add7bec8eeda0a83d03cdeab2a972fa8f3b2cfb60bbc83c9c313"],"state_sha256":"3e8f1a4f6832b14e2256137c8ea0ea0e708c44cefb4c9954cd02956d42aa1b85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOsAac0bnxk2i16XmOc0LKx32fRTqzQi/meW67yfsTUXn3y+JT58nqQw6fQ/S9BLoHvrm7R+QnLQ5FgwSUhmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:03:29.560228Z","bundle_sha256":"d25063752deb5c4d75304bb0403c1ee0a3c97ca33d71cbe9317104ecebfb6a2f"}}