{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:EIFXACWQ2BFVDGHVSTE7ZRJL2I","short_pith_number":"pith:EIFXACWQ","canonical_record":{"source":{"id":"2302.00536","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-01T16:02:31Z","cross_cats_sorted":[],"title_canon_sha256":"42e0f23fcc9499bc98879750c213b94028845a2069e41bb5d0831209a494c2e1","abstract_canon_sha256":"da893ce040f8763805e3b52ecbfe1d54180d250aca5227a8b46b64ef18116c48"},"schema_version":"1.0"},"canonical_sha256":"220b700ad0d04b5198f594c9fcc52bd222b2872b55ba8f4342b1d3b44b340084","source":{"kind":"arxiv","id":"2302.00536","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.00536","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"arxiv_version","alias_value":"2302.00536v2","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00536","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"pith_short_12","alias_value":"EIFXACWQ2BFV","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"pith_short_16","alias_value":"EIFXACWQ2BFVDGHV","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"pith_short_8","alias_value":"EIFXACWQ","created_at":"2026-07-05T08:28:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:EIFXACWQ2BFVDGHVSTE7ZRJL2I","target":"record","payload":{"canonical_record":{"source":{"id":"2302.00536","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-01T16:02:31Z","cross_cats_sorted":[],"title_canon_sha256":"42e0f23fcc9499bc98879750c213b94028845a2069e41bb5d0831209a494c2e1","abstract_canon_sha256":"da893ce040f8763805e3b52ecbfe1d54180d250aca5227a8b46b64ef18116c48"},"schema_version":"1.0"},"canonical_sha256":"220b700ad0d04b5198f594c9fcc52bd222b2872b55ba8f4342b1d3b44b340084","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:32.084707Z","signature_b64":"rX2+1u+Cqbw4PFjN/o+QBy6iZ4sBaUcNsEVuMFfuaTnbBc8hVzAlul6nTpp4irw//kmgYP9JZrEn6fjuPe1CCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"220b700ad0d04b5198f594c9fcc52bd222b2872b55ba8f4342b1d3b44b340084","last_reissued_at":"2026-07-05T08:28:32.084222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:32.084222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.00536","source_version":2,"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-05T08:28:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6oHyXxrWDQT7k/uweWoZqvLRJ9wTnJomTqCQB3b/nXOysDrLuMvjPB6KaoWJteVnJuHK8/07w5ISRQAlUn7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:16:58.048620Z"},"content_sha256":"a20e34f428213477eb16c0a162716389f4b10238d8e2945066209e3b990f6f12","schema_version":"1.0","event_id":"sha256:a20e34f428213477eb16c0a162716389f4b10238d8e2945066209e3b990f6f12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:EIFXACWQ2BFVDGHVSTE7ZRJL2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bill Fefferman, Changhun Oh, Liang Jiang, Nicol\\'as Quesada","submitted_at":"2023-02-01T16:02:31Z","abstract_excerpt":"We present a quantum-inspired classical algorithm that can be used for graph-theoretical problems, such as finding the densest $k$-subgraph and finding the maximum weight clique, which are proposed as applications of a Gaussian boson sampler. The main observation from Gaussian boson samplers is that a given graph's adjacency matrix to be encoded in a Gaussian boson sampler is nonnegative, which does not necessitate quantum interference. We first provide how to program a given graph problem into our efficient classical algorithm. We then numerically compare the performance of ideal and lossy Ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00536","kind":"arxiv","version":2},"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/2302.00536/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-05T08:28:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXrYwK3AqzNE25ahXqi1Y/dCtWvAvkM1lsPh+e3L2X6ipS4z/Z4+RTixAmmZv4oTsh40iipR+dk6Aa7xmPpsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:16:58.049259Z"},"content_sha256":"17d87a02d5e919474b08edc2a2c9ff87b6457c399bc62aa1b754bd6352932748","schema_version":"1.0","event_id":"sha256:17d87a02d5e919474b08edc2a2c9ff87b6457c399bc62aa1b754bd6352932748"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/bundle.json","state_url":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/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-05T09:16:58Z","links":{"resolver":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I","bundle":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/bundle.json","state":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EIFXACWQ2BFVDGHVSTE7ZRJL2I","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":"da893ce040f8763805e3b52ecbfe1d54180d250aca5227a8b46b64ef18116c48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-01T16:02:31Z","title_canon_sha256":"42e0f23fcc9499bc98879750c213b94028845a2069e41bb5d0831209a494c2e1"},"schema_version":"1.0","source":{"id":"2302.00536","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.00536","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"arxiv_version","alias_value":"2302.00536v2","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00536","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"pith_short_12","alias_value":"EIFXACWQ2BFV","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"pith_short_16","alias_value":"EIFXACWQ2BFVDGHV","created_at":"2026-07-05T08:28:32Z"},{"alias_kind":"pith_short_8","alias_value":"EIFXACWQ","created_at":"2026-07-05T08:28:32Z"}],"graph_snapshots":[{"event_id":"sha256:17d87a02d5e919474b08edc2a2c9ff87b6457c399bc62aa1b754bd6352932748","target":"graph","created_at":"2026-07-05T08:28:32Z","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/2302.00536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a quantum-inspired classical algorithm that can be used for graph-theoretical problems, such as finding the densest $k$-subgraph and finding the maximum weight clique, which are proposed as applications of a Gaussian boson sampler. The main observation from Gaussian boson samplers is that a given graph's adjacency matrix to be encoded in a Gaussian boson sampler is nonnegative, which does not necessitate quantum interference. We first provide how to program a given graph problem into our efficient classical algorithm. We then numerically compare the performance of ideal and lossy Ga","authors_text":"Bill Fefferman, Changhun Oh, Liang Jiang, Nicol\\'as Quesada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-01T16:02:31Z","title":"Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00536","kind":"arxiv","version":2},"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:a20e34f428213477eb16c0a162716389f4b10238d8e2945066209e3b990f6f12","target":"record","created_at":"2026-07-05T08:28:32Z","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":"da893ce040f8763805e3b52ecbfe1d54180d250aca5227a8b46b64ef18116c48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-01T16:02:31Z","title_canon_sha256":"42e0f23fcc9499bc98879750c213b94028845a2069e41bb5d0831209a494c2e1"},"schema_version":"1.0","source":{"id":"2302.00536","kind":"arxiv","version":2}},"canonical_sha256":"220b700ad0d04b5198f594c9fcc52bd222b2872b55ba8f4342b1d3b44b340084","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"220b700ad0d04b5198f594c9fcc52bd222b2872b55ba8f4342b1d3b44b340084","first_computed_at":"2026-07-05T08:28:32.084222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:28:32.084222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rX2+1u+Cqbw4PFjN/o+QBy6iZ4sBaUcNsEVuMFfuaTnbBc8hVzAlul6nTpp4irw//kmgYP9JZrEn6fjuPe1CCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:28:32.084707Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.00536","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a20e34f428213477eb16c0a162716389f4b10238d8e2945066209e3b990f6f12","sha256:17d87a02d5e919474b08edc2a2c9ff87b6457c399bc62aa1b754bd6352932748"],"state_sha256":"c4ac258b60600f4296efd43c50f54584489df2fa9fef50ba127ebf4f7f9fb462"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+mYF5rPwtMR7dU29Og+rKV5VxbaxpvCgsy3OzWGORG2VW+4IkHU5a3wtUUymK1xO3FsuIc9HEm0gM6BjdnsnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:16:58.054720Z","bundle_sha256":"bcf624f64a555f74a84aeccc6d1718b88749f270b8dfb94b52f8e78b2626f816"}}