{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EIFXACWQ2BFVDGHVSTE7ZRJL2I","short_pith_number":"pith:EIFXACWQ","schema_version":"1.0","canonical_sha256":"220b700ad0d04b5198f594c9fcc52bd222b2872b55ba8f4342b1d3b44b340084","source":{"kind":"arxiv","id":"2302.00536","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.00536","created_at":"2026-07-05T08:28:32.084278+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.00536v2","created_at":"2026-07-05T08:28:32.084278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00536","created_at":"2026-07-05T08:28:32.084278+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIFXACWQ2BFV","created_at":"2026-07-05T08:28:32.084278+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIFXACWQ2BFVDGHV","created_at":"2026-07-05T08:28:32.084278+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIFXACWQ","created_at":"2026-07-05T08:28:32.084278+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I","json":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I.json","graph_json":"https://pith.science/api/pith-number/EIFXACWQ2BFVDGHVSTE7ZRJL2I/graph.json","events_json":"https://pith.science/api/pith-number/EIFXACWQ2BFVDGHVSTE7ZRJL2I/events.json","paper":"https://pith.science/paper/EIFXACWQ"},"agent_actions":{"view_html":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I","download_json":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I.json","view_paper":"https://pith.science/paper/EIFXACWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.00536&json=true","fetch_graph":"https://pith.science/api/pith-number/EIFXACWQ2BFVDGHVSTE7ZRJL2I/graph.json","fetch_events":"https://pith.science/api/pith-number/EIFXACWQ2BFVDGHVSTE7ZRJL2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/action/storage_attestation","attest_author":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/action/author_attestation","sign_citation":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/action/citation_signature","submit_replication":"https://pith.science/pith/EIFXACWQ2BFVDGHVSTE7ZRJL2I/action/replication_record"}},"created_at":"2026-07-05T08:28:32.084278+00:00","updated_at":"2026-07-05T08:28:32.084278+00:00"}