{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:54WNHADJ6JH7XYVO6WA7YHSHDA","short_pith_number":"pith:54WNHADJ","canonical_record":{"source":{"id":"2406.19767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-28T09:13:34Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"7faabfcfe7a37653b083d5755bf4a02dd3ee08bc35f14fd4978f14ae9c23c49e","abstract_canon_sha256":"aff1ab486294d470f85b6f4a0719e41a34e6b6d07851dfae5c7381063b5029ed"},"schema_version":"1.0"},"canonical_sha256":"ef2cd38069f24ffbe2aef581fc1e471808b5b6500e85ab46e75b474a10944845","source":{"kind":"arxiv","id":"2406.19767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19767","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19767v1","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19767","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"pith_short_12","alias_value":"54WNHADJ6JH7","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"pith_short_16","alias_value":"54WNHADJ6JH7XYVO","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"pith_short_8","alias_value":"54WNHADJ","created_at":"2026-07-05T08:37:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:54WNHADJ6JH7XYVO6WA7YHSHDA","target":"record","payload":{"canonical_record":{"source":{"id":"2406.19767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-28T09:13:34Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"7faabfcfe7a37653b083d5755bf4a02dd3ee08bc35f14fd4978f14ae9c23c49e","abstract_canon_sha256":"aff1ab486294d470f85b6f4a0719e41a34e6b6d07851dfae5c7381063b5029ed"},"schema_version":"1.0"},"canonical_sha256":"ef2cd38069f24ffbe2aef581fc1e471808b5b6500e85ab46e75b474a10944845","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:54.686498Z","signature_b64":"toLJERjayzkYw0h/JZd4ZuTl40tKPAibGDLHJWjE7ra+X/sLcn8i1ZC6EJrXQQDJm+PLw0J/IKlwOn7t0yUVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef2cd38069f24ffbe2aef581fc1e471808b5b6500e85ab46e75b474a10944845","last_reissued_at":"2026-07-05T08:37:54.685995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:54.685995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.19767","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-05T08:37:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiIR0TEcMDWqi8te664PVtFIiV8qAzHMMpmfVH8qsYdrVOBbSEZK18bxwJAbEbyciiNRF1W9NL52kWZD6nS3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T12:59:13.496489Z"},"content_sha256":"55614941f9e94a1203573b08a480937963bedc426a933793ae96b90f8e432c56","schema_version":"1.0","event_id":"sha256:55614941f9e94a1203573b08a480937963bedc426a933793ae96b90f8e432c56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:54WNHADJ6JH7XYVO6WA7YHSHDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgraph Matching via Partial Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Isabel Haasler, Pascal Frossard, Wen-Xin Pan","submitted_at":"2024-06-28T09:13:34Z","abstract_excerpt":"In this work, we propose a novel approach for subgraph matching, the problem of finding a given query graph in a large source graph, based on the fused Gromov-Wasserstein distance. We formulate the subgraph matching problem as a partial fused Gromov-Wasserstein problem, which allows us to build on existing theory and computational methods in order to solve this challenging problem. We extend our method by employing a subgraph sliding approach, which makes it efficient even for large graphs. In numerical experiments, we showcase that our new algorithms have the ability to outperform state-of-th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19767","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/2406.19767/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-05T08:37:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cb75GI7Y+wLwU+Jz9OB0iswjVwA+FTf/Qm5VuKQNgm9ff1JhhowGhutE/kb2dTOyvh9w6UYFCfzFbRLEkLjXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T12:59:13.497061Z"},"content_sha256":"6866de4c557f0194988cc1829f79f1aa8a6c3bcfd156fd0fa31756bed2fe8fa5","schema_version":"1.0","event_id":"sha256:6866de4c557f0194988cc1829f79f1aa8a6c3bcfd156fd0fa31756bed2fe8fa5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/bundle.json","state_url":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/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-19T12:59:13Z","links":{"resolver":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA","bundle":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/bundle.json","state":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:54WNHADJ6JH7XYVO6WA7YHSHDA","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":"aff1ab486294d470f85b6f4a0719e41a34e6b6d07851dfae5c7381063b5029ed","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-28T09:13:34Z","title_canon_sha256":"7faabfcfe7a37653b083d5755bf4a02dd3ee08bc35f14fd4978f14ae9c23c49e"},"schema_version":"1.0","source":{"id":"2406.19767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19767","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19767v1","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19767","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"pith_short_12","alias_value":"54WNHADJ6JH7","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"pith_short_16","alias_value":"54WNHADJ6JH7XYVO","created_at":"2026-07-05T08:37:54Z"},{"alias_kind":"pith_short_8","alias_value":"54WNHADJ","created_at":"2026-07-05T08:37:54Z"}],"graph_snapshots":[{"event_id":"sha256:6866de4c557f0194988cc1829f79f1aa8a6c3bcfd156fd0fa31756bed2fe8fa5","target":"graph","created_at":"2026-07-05T08:37:54Z","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/2406.19767/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we propose a novel approach for subgraph matching, the problem of finding a given query graph in a large source graph, based on the fused Gromov-Wasserstein distance. We formulate the subgraph matching problem as a partial fused Gromov-Wasserstein problem, which allows us to build on existing theory and computational methods in order to solve this challenging problem. We extend our method by employing a subgraph sliding approach, which makes it efficient even for large graphs. In numerical experiments, we showcase that our new algorithms have the ability to outperform state-of-th","authors_text":"Isabel Haasler, Pascal Frossard, Wen-Xin Pan","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-28T09:13:34Z","title":"Subgraph Matching via Partial Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19767","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:55614941f9e94a1203573b08a480937963bedc426a933793ae96b90f8e432c56","target":"record","created_at":"2026-07-05T08:37:54Z","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":"aff1ab486294d470f85b6f4a0719e41a34e6b6d07851dfae5c7381063b5029ed","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-28T09:13:34Z","title_canon_sha256":"7faabfcfe7a37653b083d5755bf4a02dd3ee08bc35f14fd4978f14ae9c23c49e"},"schema_version":"1.0","source":{"id":"2406.19767","kind":"arxiv","version":1}},"canonical_sha256":"ef2cd38069f24ffbe2aef581fc1e471808b5b6500e85ab46e75b474a10944845","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef2cd38069f24ffbe2aef581fc1e471808b5b6500e85ab46e75b474a10944845","first_computed_at":"2026-07-05T08:37:54.685995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:37:54.685995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"toLJERjayzkYw0h/JZd4ZuTl40tKPAibGDLHJWjE7ra+X/sLcn8i1ZC6EJrXQQDJm+PLw0J/IKlwOn7t0yUVAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:37:54.686498Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.19767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55614941f9e94a1203573b08a480937963bedc426a933793ae96b90f8e432c56","sha256:6866de4c557f0194988cc1829f79f1aa8a6c3bcfd156fd0fa31756bed2fe8fa5"],"state_sha256":"99e8cfa25c2dfe8721d63ab2dede942a2e69f5598184e728c8c1faf59fb76f64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRcPUBXUveoycVWoB2yci8pztoy4JUwlVc9tmbdz8H5BOrSnSeTDpZm6iz6ZucxSWJm6qjqXnxq1s/mqUz0KBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T12:59:13.501630Z","bundle_sha256":"73bce797505338de5021614d06666b8fa30ae53a9576ab12625db88dc28ab778"}}