{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CGOIA35E7QYYQJEWAN5UYTUTCW","short_pith_number":"pith:CGOIA35E","schema_version":"1.0","canonical_sha256":"119c806fa4fc31882496037b4c4e93159306a37bdd10c55f85598537065e2a18","source":{"kind":"arxiv","id":"2508.04019","version":2},"attestation_state":"computed","paper":{"title":"Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["hep-ph","hep-th"],"primary_cat":"quant-ph","authors_text":"Germ\\'an Rodrigo, Juan P. Uribe-Ram\\'irez, Roger J. Hern\\'andez-Pinto, Salvador A. Ochoa-Oregon, Selomit Ram\\'irez-Uribe","submitted_at":"2025-08-06T02:18:08Z","abstract_excerpt":"Quantum algorithms provide a promising framework in high-energy physics, in particular, for unraveling the causal configurations of multiloop Feynman diagrams by identifying Feynman propagators with qubits, a challenge analogous to querying directed acyclic graphs in graph theory. In this paper, we present the Minimum Clique-optimised quantum Algorithm (MCA), an automated quantum algorithm designed to efficiently query the causal structures within the Loop-Tree Duality. The MCA quantum algorithm is optimised by exploiting graph theory techniques, specifically, by analogy with the Minimum Cliqu"},"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":"2508.04019","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-06T02:18:08Z","cross_cats_sorted":["hep-ph","hep-th"],"title_canon_sha256":"f83653a101afdb2647a62bf80beba12a914fe3a8ff32e25d65e93a5180e6355a","abstract_canon_sha256":"4a53d439d338966786bf1445d6c2838818c4f9ad2a0563ac063fcb98e706282c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:02.295405Z","signature_b64":"8d8bArub2oqDlVdfxZ5sEgRbz04bMwTcchiew0MRkG72hzxAB+w2Vm95PcBjST2foH35JaHl+z0vOFRczigOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119c806fa4fc31882496037b4c4e93159306a37bdd10c55f85598537065e2a18","last_reissued_at":"2026-06-08T01:05:02.294400Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:02.294400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["hep-ph","hep-th"],"primary_cat":"quant-ph","authors_text":"Germ\\'an Rodrigo, Juan P. Uribe-Ram\\'irez, Roger J. Hern\\'andez-Pinto, Salvador A. Ochoa-Oregon, Selomit Ram\\'irez-Uribe","submitted_at":"2025-08-06T02:18:08Z","abstract_excerpt":"Quantum algorithms provide a promising framework in high-energy physics, in particular, for unraveling the causal configurations of multiloop Feynman diagrams by identifying Feynman propagators with qubits, a challenge analogous to querying directed acyclic graphs in graph theory. In this paper, we present the Minimum Clique-optimised quantum Algorithm (MCA), an automated quantum algorithm designed to efficiently query the causal structures within the Loop-Tree Duality. The MCA quantum algorithm is optimised by exploiting graph theory techniques, specifically, by analogy with the Minimum Cliqu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04019","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/2508.04019/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":"2508.04019","created_at":"2026-06-08T01:05:02.294546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.04019v2","created_at":"2026-06-08T01:05:02.294546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04019","created_at":"2026-06-08T01:05:02.294546+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGOIA35E7QYY","created_at":"2026-06-08T01:05:02.294546+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGOIA35E7QYYQJEW","created_at":"2026-06-08T01:05:02.294546+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGOIA35E","created_at":"2026-06-08T01:05:02.294546+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08169","citing_title":"Overview of Applications of Quantum Computing in QCD","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW","json":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW.json","graph_json":"https://pith.science/api/pith-number/CGOIA35E7QYYQJEWAN5UYTUTCW/graph.json","events_json":"https://pith.science/api/pith-number/CGOIA35E7QYYQJEWAN5UYTUTCW/events.json","paper":"https://pith.science/paper/CGOIA35E"},"agent_actions":{"view_html":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW","download_json":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW.json","view_paper":"https://pith.science/paper/CGOIA35E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.04019&json=true","fetch_graph":"https://pith.science/api/pith-number/CGOIA35E7QYYQJEWAN5UYTUTCW/graph.json","fetch_events":"https://pith.science/api/pith-number/CGOIA35E7QYYQJEWAN5UYTUTCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW/action/storage_attestation","attest_author":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW/action/author_attestation","sign_citation":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW/action/citation_signature","submit_replication":"https://pith.science/pith/CGOIA35E7QYYQJEWAN5UYTUTCW/action/replication_record"}},"created_at":"2026-06-08T01:05:02.294546+00:00","updated_at":"2026-06-08T01:05:02.294546+00:00"}