{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Q37736CHAKNHAPC3URM7YSQIFO","short_pith_number":"pith:Q37736CH","canonical_record":{"source":{"id":"2510.03086","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-03T15:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"c881649be9ece2d1e2d0ce212c927a8bd90c3ecac0a4f813320cb6bf35f7fdd3","abstract_canon_sha256":"113103b8ff43ad19614341eecfb7ebe1cb7ce1d9753c0da38f1c83c283fa5959"},"schema_version":"1.0"},"canonical_sha256":"86fffdf847029a703c5ba459fc4a082b9549cefda0a48b4b0f71e760e1240126","source":{"kind":"arxiv","id":"2510.03086","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.03086","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"2510.03086v2","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.03086","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"Q37736CHAKNH","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"pith_short_16","alias_value":"Q37736CHAKNHAPC3","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"pith_short_8","alias_value":"Q37736CH","created_at":"2026-06-02T03:04:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Q37736CHAKNHAPC3URM7YSQIFO","target":"record","payload":{"canonical_record":{"source":{"id":"2510.03086","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-03T15:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"c881649be9ece2d1e2d0ce212c927a8bd90c3ecac0a4f813320cb6bf35f7fdd3","abstract_canon_sha256":"113103b8ff43ad19614341eecfb7ebe1cb7ce1d9753c0da38f1c83c283fa5959"},"schema_version":"1.0"},"canonical_sha256":"86fffdf847029a703c5ba459fc4a082b9549cefda0a48b4b0f71e760e1240126","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:34.781533Z","signature_b64":"CDlmkS0gdCECT9uyYsTSkkLqvwfpSBFa89FZqQqntINxR/jxsyqIb7LvaZ8qs2AZlAQaB5wjeb/h6tCMV8vkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86fffdf847029a703c5ba459fc4a082b9549cefda0a48b4b0f71e760e1240126","last_reissued_at":"2026-06-02T03:04:34.781084Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:34.781084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.03086","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-06-02T03:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+eQBwMDHvCKw5OE4kofy7qeiiHdInLSgjrynDtYB0K/X/4LnGL0PaWvN6Lf3CamXZOEL5PJYTDMh+xoO86xDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:45:30.211101Z"},"content_sha256":"9c25ff4c144df54147113d739f478a96fef804267e1c2a1cf3c5d4ecd7929d0f","schema_version":"1.0","event_id":"sha256:9c25ff4c144df54147113d739f478a96fef804267e1c2a1cf3c5d4ecd7929d0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Q37736CHAKNHAPC3URM7YSQIFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Marc Lelarge","submitted_at":"2025-10-03T15:17:00Z","abstract_excerpt":"For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly initialized FAQ remains a strong classical baseline, while existing GNN approaches struggle in the purely structural setting. We introduce a chaining procedure: a sequence of Folklore-type (2-FWL) GNNs in which each network is trained with cross-entropy after decoding the previous network's similarity matrix and ranking nodes by their current alignment quality. This non-differentiable ranking step injects discrete combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.03086","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/2510.03086/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-06-02T03:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ce3As4UL300tP20P3vBRDpX7mUfOQAn8WkiY7fthuUX8Ze4xvRoDwU+9k5b4yV5nTrHQdNtEdqQYOUxr+ePAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:45:30.211846Z"},"content_sha256":"3f1359a91224de3cd0799f08753c6be02455f898b70319e919515f8d231eab40","schema_version":"1.0","event_id":"sha256:3f1359a91224de3cd0799f08753c6be02455f898b70319e919515f8d231eab40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q37736CHAKNHAPC3URM7YSQIFO/bundle.json","state_url":"https://pith.science/pith/Q37736CHAKNHAPC3URM7YSQIFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q37736CHAKNHAPC3URM7YSQIFO/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-13T04:45:30Z","links":{"resolver":"https://pith.science/pith/Q37736CHAKNHAPC3URM7YSQIFO","bundle":"https://pith.science/pith/Q37736CHAKNHAPC3URM7YSQIFO/bundle.json","state":"https://pith.science/pith/Q37736CHAKNHAPC3URM7YSQIFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q37736CHAKNHAPC3URM7YSQIFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Q37736CHAKNHAPC3URM7YSQIFO","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":"113103b8ff43ad19614341eecfb7ebe1cb7ce1d9753c0da38f1c83c283fa5959","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-03T15:17:00Z","title_canon_sha256":"c881649be9ece2d1e2d0ce212c927a8bd90c3ecac0a4f813320cb6bf35f7fdd3"},"schema_version":"1.0","source":{"id":"2510.03086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.03086","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"2510.03086v2","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.03086","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"Q37736CHAKNH","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"pith_short_16","alias_value":"Q37736CHAKNHAPC3","created_at":"2026-06-02T03:04:34Z"},{"alias_kind":"pith_short_8","alias_value":"Q37736CH","created_at":"2026-06-02T03:04:34Z"}],"graph_snapshots":[{"event_id":"sha256:3f1359a91224de3cd0799f08753c6be02455f898b70319e919515f8d231eab40","target":"graph","created_at":"2026-06-02T03:04:34Z","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/2510.03086/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly initialized FAQ remains a strong classical baseline, while existing GNN approaches struggle in the purely structural setting. We introduce a chaining procedure: a sequence of Folklore-type (2-FWL) GNNs in which each network is trained with cross-entropy after decoding the previous network's similarity matrix and ranking nodes by their current alignment quality. This non-differentiable ranking step injects discrete combin","authors_text":"Marc Lelarge","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.03086","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:9c25ff4c144df54147113d739f478a96fef804267e1c2a1cf3c5d4ecd7929d0f","target":"record","created_at":"2026-06-02T03:04:34Z","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":"113103b8ff43ad19614341eecfb7ebe1cb7ce1d9753c0da38f1c83c283fa5959","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-03T15:17:00Z","title_canon_sha256":"c881649be9ece2d1e2d0ce212c927a8bd90c3ecac0a4f813320cb6bf35f7fdd3"},"schema_version":"1.0","source":{"id":"2510.03086","kind":"arxiv","version":2}},"canonical_sha256":"86fffdf847029a703c5ba459fc4a082b9549cefda0a48b4b0f71e760e1240126","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86fffdf847029a703c5ba459fc4a082b9549cefda0a48b4b0f71e760e1240126","first_computed_at":"2026-06-02T03:04:34.781084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T03:04:34.781084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CDlmkS0gdCECT9uyYsTSkkLqvwfpSBFa89FZqQqntINxR/jxsyqIb7LvaZ8qs2AZlAQaB5wjeb/h6tCMV8vkDQ==","signature_status":"signed_v1","signed_at":"2026-06-02T03:04:34.781533Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.03086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c25ff4c144df54147113d739f478a96fef804267e1c2a1cf3c5d4ecd7929d0f","sha256:3f1359a91224de3cd0799f08753c6be02455f898b70319e919515f8d231eab40"],"state_sha256":"429350a6e7ec867a4365b45181fc6482b91ab0dbe10a6e0df1747453f98cca10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2a0kjxT1MBX4uo6k7BbSoYLzekmaOhB7UdG+otK2klfKQuIacOCDLBTJ8tBmrYDAoNPqUvOU37TWXwDb6zdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T04:45:30.217981Z","bundle_sha256":"78c6a24c1d04262bcb6b0275285cc1ad289f99f3a1073747a849b9ca268d4be6"}}