{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:L4J6WB5RRWRTUZPZXAWRXWDOBM","short_pith_number":"pith:L4J6WB5R","canonical_record":{"source":{"id":"2510.14905","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-16T17:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"f00a05e01931f356b733232dc5beb5948ed3f9a3f631f22220a4f0c87c6cbb7d","abstract_canon_sha256":"6de3c57c24fe58c96e69ef6f1ebbe2b1de2338b1d7b81867ed68fdc34b22cfc3"},"schema_version":"1.0"},"canonical_sha256":"5f13eb07b18da33a65f9b82d1bd86e0b2239f4df4616283b1ab80f9f6744a92c","source":{"kind":"arxiv","id":"2510.14905","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.14905","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2510.14905v3","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.14905","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"L4J6WB5RRWRT","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"L4J6WB5RRWRTUZPZ","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"L4J6WB5R","created_at":"2026-05-26T02:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:L4J6WB5RRWRTUZPZXAWRXWDOBM","target":"record","payload":{"canonical_record":{"source":{"id":"2510.14905","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-16T17:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"f00a05e01931f356b733232dc5beb5948ed3f9a3f631f22220a4f0c87c6cbb7d","abstract_canon_sha256":"6de3c57c24fe58c96e69ef6f1ebbe2b1de2338b1d7b81867ed68fdc34b22cfc3"},"schema_version":"1.0"},"canonical_sha256":"5f13eb07b18da33a65f9b82d1bd86e0b2239f4df4616283b1ab80f9f6744a92c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:03.175989Z","signature_b64":"xKJ+TqqJrg3D+vMlmEnuXug0PrCW0kcjO4h/YG2wtPFxOX9JX0M7poTSB2VZKzSYZoDLgwrhG7JZSDUUroSYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f13eb07b18da33a65f9b82d1bd86e0b2239f4df4616283b1ab80f9f6744a92c","last_reissued_at":"2026-05-26T02:05:03.175055Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:03.175055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.14905","source_version":3,"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-26T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"indSkzdpofWRK/dDJZRbYNr+VsNquHBHK0iC8fdXr3+X3AWq26goAsPKaYGUDwcIEWGoC7i5B5co53Q/cQUlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:11:45.392328Z"},"content_sha256":"6a32dc003b20b44913383e0865bcf7c401550573f27a66c48de02bce06b24c95","schema_version":"1.0","event_id":"sha256:6a32dc003b20b44913383e0865bcf7c401550573f27a66c48de02bce06b24c95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:L4J6WB5RRWRTUZPZXAWRXWDOBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum circuit model for continuous-time quantum walks on random graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rohit Kishan Ray, Rohit Sarma Sarkar, Sabyasachi Chakraborty, Sonjoy Majumder","submitted_at":"2025-10-16T17:24:14Z","abstract_excerpt":"Quantum-circuit implementations of continuous-time quantum walks (CTQWs) can provide an efficient route to model graph-based algorithms. However, constructing circuits that faithfully reproduce CTQW dynamics across arbitrary graphs remains a major challenge. In this work, we introduce a Laplacian partitioning algorithm (LPA) that enables an efficient and scalable quantum-circuit realization of CTQWs on random graphs. A common algorithm to simulate a general graph (of size $N = 2^n$ for $n$ qubits) on a quantum circuit is based on Pauli decomposition of the graph Hamiltonian, which can yield $O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.14905","kind":"arxiv","version":3},"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/2510.14905/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-05-26T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcQdDc03GjJbV3mtcNRQU7b4OY2V27wKzMazWdDUsBLBbZe2wSBpotsJJFBeE+4uH+dIper3wz08CRRVha//Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:11:45.392713Z"},"content_sha256":"0003f8c796b29750ea90f8a2fbea861ce9c644e48e74320c00df6b7c4098fea8","schema_version":"1.0","event_id":"sha256:0003f8c796b29750ea90f8a2fbea861ce9c644e48e74320c00df6b7c4098fea8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/bundle.json","state_url":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/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-06-03T10:11:45Z","links":{"resolver":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM","bundle":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/bundle.json","state":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:L4J6WB5RRWRTUZPZXAWRXWDOBM","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":"6de3c57c24fe58c96e69ef6f1ebbe2b1de2338b1d7b81867ed68fdc34b22cfc3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-16T17:24:14Z","title_canon_sha256":"f00a05e01931f356b733232dc5beb5948ed3f9a3f631f22220a4f0c87c6cbb7d"},"schema_version":"1.0","source":{"id":"2510.14905","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.14905","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2510.14905v3","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.14905","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"L4J6WB5RRWRT","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"L4J6WB5RRWRTUZPZ","created_at":"2026-05-26T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"L4J6WB5R","created_at":"2026-05-26T02:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:0003f8c796b29750ea90f8a2fbea861ce9c644e48e74320c00df6b7c4098fea8","target":"graph","created_at":"2026-05-26T02:05:03Z","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/2510.14905/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum-circuit implementations of continuous-time quantum walks (CTQWs) can provide an efficient route to model graph-based algorithms. However, constructing circuits that faithfully reproduce CTQW dynamics across arbitrary graphs remains a major challenge. In this work, we introduce a Laplacian partitioning algorithm (LPA) that enables an efficient and scalable quantum-circuit realization of CTQWs on random graphs. A common algorithm to simulate a general graph (of size $N = 2^n$ for $n$ qubits) on a quantum circuit is based on Pauli decomposition of the graph Hamiltonian, which can yield $O","authors_text":"Rohit Kishan Ray, Rohit Sarma Sarkar, Sabyasachi Chakraborty, Sonjoy Majumder","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-16T17:24:14Z","title":"Quantum circuit model for continuous-time quantum walks on random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.14905","kind":"arxiv","version":3},"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:6a32dc003b20b44913383e0865bcf7c401550573f27a66c48de02bce06b24c95","target":"record","created_at":"2026-05-26T02:05:03Z","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":"6de3c57c24fe58c96e69ef6f1ebbe2b1de2338b1d7b81867ed68fdc34b22cfc3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-16T17:24:14Z","title_canon_sha256":"f00a05e01931f356b733232dc5beb5948ed3f9a3f631f22220a4f0c87c6cbb7d"},"schema_version":"1.0","source":{"id":"2510.14905","kind":"arxiv","version":3}},"canonical_sha256":"5f13eb07b18da33a65f9b82d1bd86e0b2239f4df4616283b1ab80f9f6744a92c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f13eb07b18da33a65f9b82d1bd86e0b2239f4df4616283b1ab80f9f6744a92c","first_computed_at":"2026-05-26T02:05:03.175055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:05:03.175055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xKJ+TqqJrg3D+vMlmEnuXug0PrCW0kcjO4h/YG2wtPFxOX9JX0M7poTSB2VZKzSYZoDLgwrhG7JZSDUUroSYBA==","signature_status":"signed_v1","signed_at":"2026-05-26T02:05:03.175989Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.14905","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a32dc003b20b44913383e0865bcf7c401550573f27a66c48de02bce06b24c95","sha256:0003f8c796b29750ea90f8a2fbea861ce9c644e48e74320c00df6b7c4098fea8"],"state_sha256":"7aa25eeef99831842913a6a0582c991f452d38c192de973cde7318761ebc6616"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yx6w0ml49SKjdRWxJoRBsf2OQvTSOtVfAwn+Ocpkzxw1Qdx2ZW1LBALTaUfxVUKQliYVxW/5z3fTwY7E83pLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:11:45.394796Z","bundle_sha256":"6a3c35a6e7598268ea47614120cde998dbca91db05c8b5cd5b852a05756e531e"}}