{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JGTLFRP2Q3QX2SF3QNLH63OOGZ","short_pith_number":"pith:JGTLFRP2","canonical_record":{"source":{"id":"2504.21135","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T19:41:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9209a4987946bf1c88977cf0b51791b186d527114380584fdb2662bdc1fb3716","abstract_canon_sha256":"e00330ef0fff349a83a1173b046f510692611b11dadead055c3756fe72e8444b"},"schema_version":"1.0"},"canonical_sha256":"49a6b2c5fa86e17d48bb83567f6dce3663d08887ede134a0d6a81bc609dd58eb","source":{"kind":"arxiv","id":"2504.21135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21135","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21135v1","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21135","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"JGTLFRP2Q3QX","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"pith_short_16","alias_value":"JGTLFRP2Q3QX2SF3","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"pith_short_8","alias_value":"JGTLFRP2","created_at":"2026-07-05T10:55:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JGTLFRP2Q3QX2SF3QNLH63OOGZ","target":"record","payload":{"canonical_record":{"source":{"id":"2504.21135","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T19:41:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9209a4987946bf1c88977cf0b51791b186d527114380584fdb2662bdc1fb3716","abstract_canon_sha256":"e00330ef0fff349a83a1173b046f510692611b11dadead055c3756fe72e8444b"},"schema_version":"1.0"},"canonical_sha256":"49a6b2c5fa86e17d48bb83567f6dce3663d08887ede134a0d6a81bc609dd58eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:57.804240Z","signature_b64":"QmiJUAzh4t43Oinr1zIRXOdFVM3e74/wuJFl+b8DGMGQ2l89lDuOyRHPovz0Z+b0yKuIjRx4EPppxxy8+5qxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49a6b2c5fa86e17d48bb83567f6dce3663d08887ede134a0d6a81bc609dd58eb","last_reissued_at":"2026-07-05T10:55:57.803755Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:57.803755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.21135","source_version":1,"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-05T10:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1nFlFnhAUKaTLreXPfzMAE6ZuMJ0LoXdM6FzYPOg1z0YzSBUwiIU/IR7KqTPDNHEVeausUucnzBWAQgORXSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:14:42.869102Z"},"content_sha256":"f47b63114f3f95628fedc0ea7df56e5da7c17372fcfcde6095cc6b68712ad0bb","schema_version":"1.0","event_id":"sha256:f47b63114f3f95628fedc0ea7df56e5da7c17372fcfcde6095cc6b68712ad0bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JGTLFRP2Q3QX2SF3QNLH63OOGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Alex Pothen, Hanjing Xu, Ilya Safro, Xiaoyuan Liu","submitted_at":"2025-04-29T19:41:05Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is one of the promising variational approaches of quantum computing to solve combinatorial optimization problems. In QAOA, variational parameters need to be optimized by solving a series of nonlinear, nonconvex optimization programs. In this work, we propose a QAOA parameter transfer scheme using Graph Attention Networks (GAT) to solve Maximum Independent Set (MIS) problems. We prepare optimized parameters for graphs of 12 and 14 vertices and use GATs to transfer their parameters to larger graphs. Additionally, we design a hybrid distribute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21135","kind":"arxiv","version":1},"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/2504.21135/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-05T10:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"va/kdrqrhY4KwBU4pQsd+M2eCn6A7JQRC4A7MAS0WkuL3L/hhZ1x94v8C2XwK3Hf1y/FLDCYu5ePiO8PBXOOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:14:42.869495Z"},"content_sha256":"7b1c0b5515d5055aed9c42d3b06908e13bc444a7d132f58ad398964e3ea02ae2","schema_version":"1.0","event_id":"sha256:7b1c0b5515d5055aed9c42d3b06908e13bc444a7d132f58ad398964e3ea02ae2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/bundle.json","state_url":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/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-07-06T08:14:42Z","links":{"resolver":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ","bundle":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/bundle.json","state":"https://pith.science/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGTLFRP2Q3QX2SF3QNLH63OOGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JGTLFRP2Q3QX2SF3QNLH63OOGZ","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":"e00330ef0fff349a83a1173b046f510692611b11dadead055c3756fe72e8444b","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T19:41:05Z","title_canon_sha256":"9209a4987946bf1c88977cf0b51791b186d527114380584fdb2662bdc1fb3716"},"schema_version":"1.0","source":{"id":"2504.21135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21135","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21135v1","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21135","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"JGTLFRP2Q3QX","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"pith_short_16","alias_value":"JGTLFRP2Q3QX2SF3","created_at":"2026-07-05T10:55:57Z"},{"alias_kind":"pith_short_8","alias_value":"JGTLFRP2","created_at":"2026-07-05T10:55:57Z"}],"graph_snapshots":[{"event_id":"sha256:7b1c0b5515d5055aed9c42d3b06908e13bc444a7d132f58ad398964e3ea02ae2","target":"graph","created_at":"2026-07-05T10:55:57Z","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/2504.21135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is one of the promising variational approaches of quantum computing to solve combinatorial optimization problems. In QAOA, variational parameters need to be optimized by solving a series of nonlinear, nonconvex optimization programs. In this work, we propose a QAOA parameter transfer scheme using Graph Attention Networks (GAT) to solve Maximum Independent Set (MIS) problems. We prepare optimized parameters for graphs of 12 and 14 vertices and use GATs to transfer their parameters to larger graphs. Additionally, we design a hybrid distribute","authors_text":"Alex Pothen, Hanjing Xu, Ilya Safro, Xiaoyuan Liu","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T19:41:05Z","title":"QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21135","kind":"arxiv","version":1},"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:f47b63114f3f95628fedc0ea7df56e5da7c17372fcfcde6095cc6b68712ad0bb","target":"record","created_at":"2026-07-05T10:55:57Z","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":"e00330ef0fff349a83a1173b046f510692611b11dadead055c3756fe72e8444b","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T19:41:05Z","title_canon_sha256":"9209a4987946bf1c88977cf0b51791b186d527114380584fdb2662bdc1fb3716"},"schema_version":"1.0","source":{"id":"2504.21135","kind":"arxiv","version":1}},"canonical_sha256":"49a6b2c5fa86e17d48bb83567f6dce3663d08887ede134a0d6a81bc609dd58eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49a6b2c5fa86e17d48bb83567f6dce3663d08887ede134a0d6a81bc609dd58eb","first_computed_at":"2026-07-05T10:55:57.803755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:55:57.803755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QmiJUAzh4t43Oinr1zIRXOdFVM3e74/wuJFl+b8DGMGQ2l89lDuOyRHPovz0Z+b0yKuIjRx4EPppxxy8+5qxBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:55:57.804240Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.21135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f47b63114f3f95628fedc0ea7df56e5da7c17372fcfcde6095cc6b68712ad0bb","sha256:7b1c0b5515d5055aed9c42d3b06908e13bc444a7d132f58ad398964e3ea02ae2"],"state_sha256":"159779ef22ec4a726837c9b7844dda29ea1287c8d30a368c849209074ffb03d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJ7UM+81DMTpOrIbnv4WFSXQckI0jU+sSSjVOspR2ON9CPUx4aLMuZgE92NPQaa48CoveVz0PuD8Sopq18ngDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T08:14:42.871519Z","bundle_sha256":"ae78a53e4cb16b11c119c10ce2ae63d5f581de00867bea5a98af997ec26357de"}}