{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:V3FUSG6UMDC2BCPP7AT5X7QJQH","short_pith_number":"pith:V3FUSG6U","canonical_record":{"source":{"id":"2508.00514","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-01T10:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"eff592ba4b2f816201be52327f8793f7d10c520db517084a635f95a1354d70de","abstract_canon_sha256":"2f3b02988455f37b266d4b73552b3278660a7af0cbe44919a030d5ff56d2a554"},"schema_version":"1.0"},"canonical_sha256":"aecb491bd460c5a089eff827dbfe0981c8ffb10fd35d7ee4a8155e38433b16a2","source":{"kind":"arxiv","id":"2508.00514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.00514","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"2508.00514v1","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.00514","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"V3FUSG6UMDC2","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"pith_short_16","alias_value":"V3FUSG6UMDC2BCPP","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"pith_short_8","alias_value":"V3FUSG6U","created_at":"2026-07-05T11:46:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:V3FUSG6UMDC2BCPP7AT5X7QJQH","target":"record","payload":{"canonical_record":{"source":{"id":"2508.00514","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-01T10:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"eff592ba4b2f816201be52327f8793f7d10c520db517084a635f95a1354d70de","abstract_canon_sha256":"2f3b02988455f37b266d4b73552b3278660a7af0cbe44919a030d5ff56d2a554"},"schema_version":"1.0"},"canonical_sha256":"aecb491bd460c5a089eff827dbfe0981c8ffb10fd35d7ee4a8155e38433b16a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:57.468146Z","signature_b64":"EDlqj1QSLQzwL6SCzu3kBrKPj4plQh2zhuhDd0VcZAZBaOVxVdnWcNAzcmQT6z29YwKEKL0LPEPrjgcX2AuzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aecb491bd460c5a089eff827dbfe0981c8ffb10fd35d7ee4a8155e38433b16a2","last_reissued_at":"2026-07-05T11:46:57.467599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:57.467599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.00514","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-05T11:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jx1FgTbXsEaFvSpfzSw1TlEn2UNDgQrYCfhcioZSANd6kOhp4R4LHDthP3/hbPK6CyuQEMYdnS6/YtQXrb3JCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:30:20.196210Z"},"content_sha256":"d96e8e59ec9f4bf82e33d3a14f2040f09684d11376ccdebe8cf27b7febf5be97","schema_version":"1.0","event_id":"sha256:d96e8e59ec9f4bf82e33d3a14f2040f09684d11376ccdebe8cf27b7febf5be97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:V3FUSG6UMDC2BCPP7AT5X7QJQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alfons Laarman, Sebastiaan Brand","submitted_at":"2025-08-01T10:48:52Z","abstract_excerpt":"As physical realizations of quantum computers move closer towards practical applications, the need for tools to analyze and verify quantum algorithms grows. Among the algorithms and data structures used to tackle such problems, decision diagrams (DDs) have shown much success. However, an obstacle with DDs is their efficient parallelization, and while parallel speedups have been obtained for DDs used in classical applications, attempts to parallelize operations for quantum-specific DDs have yielded only limited success. In this work, we present an efficient implementation of parallel edge-value"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.00514","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/2508.00514/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-05T11:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fqiPxja53GtFnkZTvi4QHgmolxA4ghnlklAni8l26HM8p6UjvnuStj7gUp2uVLxZWECwQBsc5AEyX2KJwwyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:30:20.196694Z"},"content_sha256":"9656f5e90d2a5785d008035e9eb1f3f9cb043ec6c34d1dda00faa89e6b0ff9af","schema_version":"1.0","event_id":"sha256:9656f5e90d2a5785d008035e9eb1f3f9cb043ec6c34d1dda00faa89e6b0ff9af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3FUSG6UMDC2BCPP7AT5X7QJQH/bundle.json","state_url":"https://pith.science/pith/V3FUSG6UMDC2BCPP7AT5X7QJQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3FUSG6UMDC2BCPP7AT5X7QJQH/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-09T16:30:20Z","links":{"resolver":"https://pith.science/pith/V3FUSG6UMDC2BCPP7AT5X7QJQH","bundle":"https://pith.science/pith/V3FUSG6UMDC2BCPP7AT5X7QJQH/bundle.json","state":"https://pith.science/pith/V3FUSG6UMDC2BCPP7AT5X7QJQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3FUSG6UMDC2BCPP7AT5X7QJQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V3FUSG6UMDC2BCPP7AT5X7QJQH","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":"2f3b02988455f37b266d4b73552b3278660a7af0cbe44919a030d5ff56d2a554","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-01T10:48:52Z","title_canon_sha256":"eff592ba4b2f816201be52327f8793f7d10c520db517084a635f95a1354d70de"},"schema_version":"1.0","source":{"id":"2508.00514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.00514","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"2508.00514v1","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.00514","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"V3FUSG6UMDC2","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"pith_short_16","alias_value":"V3FUSG6UMDC2BCPP","created_at":"2026-07-05T11:46:57Z"},{"alias_kind":"pith_short_8","alias_value":"V3FUSG6U","created_at":"2026-07-05T11:46:57Z"}],"graph_snapshots":[{"event_id":"sha256:9656f5e90d2a5785d008035e9eb1f3f9cb043ec6c34d1dda00faa89e6b0ff9af","target":"graph","created_at":"2026-07-05T11:46:57Z","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/2508.00514/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As physical realizations of quantum computers move closer towards practical applications, the need for tools to analyze and verify quantum algorithms grows. Among the algorithms and data structures used to tackle such problems, decision diagrams (DDs) have shown much success. However, an obstacle with DDs is their efficient parallelization, and while parallel speedups have been obtained for DDs used in classical applications, attempts to parallelize operations for quantum-specific DDs have yielded only limited success. In this work, we present an efficient implementation of parallel edge-value","authors_text":"Alfons Laarman, Sebastiaan Brand","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-01T10:48:52Z","title":"Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.00514","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:d96e8e59ec9f4bf82e33d3a14f2040f09684d11376ccdebe8cf27b7febf5be97","target":"record","created_at":"2026-07-05T11:46:57Z","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":"2f3b02988455f37b266d4b73552b3278660a7af0cbe44919a030d5ff56d2a554","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-01T10:48:52Z","title_canon_sha256":"eff592ba4b2f816201be52327f8793f7d10c520db517084a635f95a1354d70de"},"schema_version":"1.0","source":{"id":"2508.00514","kind":"arxiv","version":1}},"canonical_sha256":"aecb491bd460c5a089eff827dbfe0981c8ffb10fd35d7ee4a8155e38433b16a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aecb491bd460c5a089eff827dbfe0981c8ffb10fd35d7ee4a8155e38433b16a2","first_computed_at":"2026-07-05T11:46:57.467599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:46:57.467599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EDlqj1QSLQzwL6SCzu3kBrKPj4plQh2zhuhDd0VcZAZBaOVxVdnWcNAzcmQT6z29YwKEKL0LPEPrjgcX2AuzAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:46:57.468146Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.00514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d96e8e59ec9f4bf82e33d3a14f2040f09684d11376ccdebe8cf27b7febf5be97","sha256:9656f5e90d2a5785d008035e9eb1f3f9cb043ec6c34d1dda00faa89e6b0ff9af"],"state_sha256":"b3b23ec85ea17d1a6ba6f70cde923b3c063cb9b2edcb4de81329129814bdc2fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Vd9h++XV3eORfikA6fP85dfMO6bpRYcSlKDfhECI3ul+28nOW4gabXOQEdmUMMcDqweoEf0OQ2YDlzVbcSGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T16:30:20.199947Z","bundle_sha256":"b9e83e0008987bf32d85d831e03eba1f2e90d2a10d2f56b284397467d1e1ae05"}}