{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:54WNHADJ6JH7XYVO6WA7YHSHDA","short_pith_number":"pith:54WNHADJ","schema_version":"1.0","canonical_sha256":"ef2cd38069f24ffbe2aef581fc1e471808b5b6500e85ab46e75b474a10944845","source":{"kind":"arxiv","id":"2406.19767","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.19767","created_at":"2026-07-05T08:37:54.686069+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19767v1","created_at":"2026-07-05T08:37:54.686069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19767","created_at":"2026-07-05T08:37:54.686069+00:00"},{"alias_kind":"pith_short_12","alias_value":"54WNHADJ6JH7","created_at":"2026-07-05T08:37:54.686069+00:00"},{"alias_kind":"pith_short_16","alias_value":"54WNHADJ6JH7XYVO","created_at":"2026-07-05T08:37:54.686069+00:00"},{"alias_kind":"pith_short_8","alias_value":"54WNHADJ","created_at":"2026-07-05T08:37:54.686069+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA","json":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA.json","graph_json":"https://pith.science/api/pith-number/54WNHADJ6JH7XYVO6WA7YHSHDA/graph.json","events_json":"https://pith.science/api/pith-number/54WNHADJ6JH7XYVO6WA7YHSHDA/events.json","paper":"https://pith.science/paper/54WNHADJ"},"agent_actions":{"view_html":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA","download_json":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA.json","view_paper":"https://pith.science/paper/54WNHADJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19767&json=true","fetch_graph":"https://pith.science/api/pith-number/54WNHADJ6JH7XYVO6WA7YHSHDA/graph.json","fetch_events":"https://pith.science/api/pith-number/54WNHADJ6JH7XYVO6WA7YHSHDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/action/storage_attestation","attest_author":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/action/author_attestation","sign_citation":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/action/citation_signature","submit_replication":"https://pith.science/pith/54WNHADJ6JH7XYVO6WA7YHSHDA/action/replication_record"}},"created_at":"2026-07-05T08:37:54.686069+00:00","updated_at":"2026-07-05T08:37:54.686069+00:00"}