{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LZBBE7SWZWOV76MFULTNVYNNPK","short_pith_number":"pith:LZBBE7SW","schema_version":"1.0","canonical_sha256":"5e42127e56cd9d5ff985a2e6dae1ad7aba7ee76d8c848f96c39cd2b99f8219c1","source":{"kind":"arxiv","id":"2606.02223","version":1},"attestation_state":"computed","paper":{"title":"Network Learning with Semi-relaxed Gromov-Wasserstein","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ME","stat.TH"],"primary_cat":"cs.LG","authors_text":"Charles Dufour, Leonardo V. Santoro, Ulysse Naepels","submitted_at":"2026-06-01T13:21:17Z","abstract_excerpt":"Estimating the generative mechanism of large-scale networks is a fundamental challenge in statistical machine learning. It requires the identification of the latent connectivity structure, which is in general an NP-hard combinatorial problem due to the absence of canonical node labels. We address this challenge by allowing for probabilistic couplings, thereby relaxing the assignment problem. Our estimation framework can be formulated as a semi-relaxed Gromov-Wasserstein objective and provides a low-dimensional representation of the generative structure. We solve this via a block-coordinate con"},"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":"2606.02223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T13:21:17Z","cross_cats_sorted":["math.ST","stat.ME","stat.TH"],"title_canon_sha256":"b5fb8cf66bae48fd31c411d135d4c0454dfcd5c39a8408a1ae9b301eb6027903","abstract_canon_sha256":"3323016bcb2e03d26f1bdea1f7ccf888c668b27becb5767198afbcde6623eceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:53.563397Z","signature_b64":"18Z+MXQktJoVxSD8Va+xQ/P1nQmlfNRQfCBbGINLAg+moMWpUZE7LLxCMT4MmKhi+m2GG2OL2IjTMEK1rJqsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e42127e56cd9d5ff985a2e6dae1ad7aba7ee76d8c848f96c39cd2b99f8219c1","last_reissued_at":"2026-06-02T03:04:53.563005Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:53.563005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Learning with Semi-relaxed Gromov-Wasserstein","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ME","stat.TH"],"primary_cat":"cs.LG","authors_text":"Charles Dufour, Leonardo V. Santoro, Ulysse Naepels","submitted_at":"2026-06-01T13:21:17Z","abstract_excerpt":"Estimating the generative mechanism of large-scale networks is a fundamental challenge in statistical machine learning. It requires the identification of the latent connectivity structure, which is in general an NP-hard combinatorial problem due to the absence of canonical node labels. We address this challenge by allowing for probabilistic couplings, thereby relaxing the assignment problem. Our estimation framework can be formulated as a semi-relaxed Gromov-Wasserstein objective and provides a low-dimensional representation of the generative structure. We solve this via a block-coordinate con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02223","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/2606.02223/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":"2606.02223","created_at":"2026-06-02T03:04:53.563061+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02223v1","created_at":"2026-06-02T03:04:53.563061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02223","created_at":"2026-06-02T03:04:53.563061+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZBBE7SWZWOV","created_at":"2026-06-02T03:04:53.563061+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZBBE7SWZWOV76MF","created_at":"2026-06-02T03:04:53.563061+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZBBE7SW","created_at":"2026-06-02T03:04:53.563061+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/LZBBE7SWZWOV76MFULTNVYNNPK","json":"https://pith.science/pith/LZBBE7SWZWOV76MFULTNVYNNPK.json","graph_json":"https://pith.science/api/pith-number/LZBBE7SWZWOV76MFULTNVYNNPK/graph.json","events_json":"https://pith.science/api/pith-number/LZBBE7SWZWOV76MFULTNVYNNPK/events.json","paper":"https://pith.science/paper/LZBBE7SW"},"agent_actions":{"view_html":"https://pith.science/pith/LZBBE7SWZWOV76MFULTNVYNNPK","download_json":"https://pith.science/pith/LZBBE7SWZWOV76MFULTNVYNNPK.json","view_paper":"https://pith.science/paper/LZBBE7SW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02223&json=true","fetch_graph":"https://pith.science/api/pith-number/LZBBE7SWZWOV76MFULTNVYNNPK/graph.json","fetch_events":"https://pith.science/api/pith-number/LZBBE7SWZWOV76MFULTNVYNNPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZBBE7SWZWOV76MFULTNVYNNPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZBBE7SWZWOV76MFULTNVYNNPK/action/storage_attestation","attest_author":"https://pith.science/pith/LZBBE7SWZWOV76MFULTNVYNNPK/action/author_attestation","sign_citation":"https://pith.science/pith/LZBBE7SWZWOV76MFULTNVYNNPK/action/citation_signature","submit_replication":"https://pith.science/pith/LZBBE7SWZWOV76MFULTNVYNNPK/action/replication_record"}},"created_at":"2026-06-02T03:04:53.563061+00:00","updated_at":"2026-06-02T03:04:53.563061+00:00"}