{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GZGKYOHBUBZNIYN6LUUFFM4RSV","short_pith_number":"pith:GZGKYOHB","schema_version":"1.0","canonical_sha256":"364cac38e1a072d461be5d2852b391954c49c86d85f7c12c23590665b27886f0","source":{"kind":"arxiv","id":"2505.12764","version":2},"attestation_state":"computed","paper":{"title":"Solving graph problems using permutation-invariant quantum machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alejandro Bravo de la Serna, Claudia Linnhoff-Popien, Dimitra Nikolaidou, Dmytro Bondarenko, Gautham Sathish, Gerhard Stenzel, Linus Menzel, Maximilian Balthasar Mansky, Santiago Londo\\~no Castillo, Tobias Rohe","submitted_at":"2025-05-19T06:44:03Z","abstract_excerpt":"Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond to the specific symmetry of the problem. We investigate this adaption of the quantum circuit to the problem symmetry on graph classification problems. On random graphs, the quantum machine learning ansatz classifies whether a given random graph is connected, bipartite, contains a Hamiltonian path or cycle, respectively. We find that if the quantum circuit r"},"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":"2505.12764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-19T06:44:03Z","cross_cats_sorted":[],"title_canon_sha256":"d00a50a3f73ff0b593c5004ec9ead5848e1ab4b31c0edd0c9da6dd0775119edf","abstract_canon_sha256":"a7b882b898158f8c6f073ff878eb80436d4e16086bfa291f3d3e1d0697c9a233"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:45.599712Z","signature_b64":"mPwD01q5ui5NdGCpZNZl4rzdqLWW0CxYi4+GPt5w+DyQc5guQNSfrw2rEr6w0NKbz6ltL3UB8hnPfW9AffIeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"364cac38e1a072d461be5d2852b391954c49c86d85f7c12c23590665b27886f0","last_reissued_at":"2026-07-05T11:05:45.599218Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:45.599218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving graph problems using permutation-invariant quantum machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alejandro Bravo de la Serna, Claudia Linnhoff-Popien, Dimitra Nikolaidou, Dmytro Bondarenko, Gautham Sathish, Gerhard Stenzel, Linus Menzel, Maximilian Balthasar Mansky, Santiago Londo\\~no Castillo, Tobias Rohe","submitted_at":"2025-05-19T06:44:03Z","abstract_excerpt":"Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond to the specific symmetry of the problem. We investigate this adaption of the quantum circuit to the problem symmetry on graph classification problems. On random graphs, the quantum machine learning ansatz classifies whether a given random graph is connected, bipartite, contains a Hamiltonian path or cycle, respectively. We find that if the quantum circuit r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12764","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/2505.12764/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":"2505.12764","created_at":"2026-07-05T11:05:45.599269+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.12764v2","created_at":"2026-07-05T11:05:45.599269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12764","created_at":"2026-07-05T11:05:45.599269+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZGKYOHBUBZN","created_at":"2026-07-05T11:05:45.599269+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZGKYOHBUBZNIYN6","created_at":"2026-07-05T11:05:45.599269+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZGKYOHB","created_at":"2026-07-05T11:05:45.599269+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12427","citing_title":"Analysis of quantum neural network performance via edge cases","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV","json":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV.json","graph_json":"https://pith.science/api/pith-number/GZGKYOHBUBZNIYN6LUUFFM4RSV/graph.json","events_json":"https://pith.science/api/pith-number/GZGKYOHBUBZNIYN6LUUFFM4RSV/events.json","paper":"https://pith.science/paper/GZGKYOHB"},"agent_actions":{"view_html":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV","download_json":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV.json","view_paper":"https://pith.science/paper/GZGKYOHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.12764&json=true","fetch_graph":"https://pith.science/api/pith-number/GZGKYOHBUBZNIYN6LUUFFM4RSV/graph.json","fetch_events":"https://pith.science/api/pith-number/GZGKYOHBUBZNIYN6LUUFFM4RSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV/action/storage_attestation","attest_author":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV/action/author_attestation","sign_citation":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV/action/citation_signature","submit_replication":"https://pith.science/pith/GZGKYOHBUBZNIYN6LUUFFM4RSV/action/replication_record"}},"created_at":"2026-07-05T11:05:45.599269+00:00","updated_at":"2026-07-05T11:05:45.599269+00:00"}