{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VGPWRSPRXDV6GDGKVXDYYJZCMY","short_pith_number":"pith:VGPWRSPR","schema_version":"1.0","canonical_sha256":"a99f68c9f1b8ebe30ccaadc78c2722662096beefa22efeb9ed23026db252da48","source":{"kind":"arxiv","id":"2509.06894","version":1},"attestation_state":"computed","paper":{"title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","math.MG","math.PR","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"A. Martina Neuman, Anastasis Kratsios, Giulia Livieri, Luca Galimberti, Nils Detering","submitted_at":"2025-09-08T17:13:28Z","abstract_excerpt":"Since their introduction by Kipf and Welling in $2017$, a primary use of graph convolutional networks is transductive node classification, where missing labels are inferred within a single observed graph and its feature matrix. Despite the widespread use of the network model, the statistical foundations of transductive learning remain limited, as standard inference frameworks typically rely on multiple independent samples rather than a single graph. In this work, we address these gaps by developing new concentration-of-measure tools that leverage the geometric regularities of large graphs via "},"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":"2509.06894","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ML","submitted_at":"2025-09-08T17:13:28Z","cross_cats_sorted":["cs.LG","math.MG","math.PR","math.ST","stat.TH"],"title_canon_sha256":"1c8330143e542ad89c49bf5b89f2f0fe5cdbf3380077781e8b537c870c1a0a81","abstract_canon_sha256":"defef088003593bd1b41d0039a2f61bfa386d6bb4e0c3c7476e0d5e2a54b2747"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:54.686446Z","signature_b64":"iVaoEuOWaPkSFmr3EsjI0PWUp1gBreUGyLamzq+j8vlAuSonLwszUr/l9oZZQc9OacyC1iycWli4QbDGm81iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a99f68c9f1b8ebe30ccaadc78c2722662096beefa22efeb9ed23026db252da48","last_reissued_at":"2026-07-05T12:06:54.685978Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:54.685978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","math.MG","math.PR","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"A. Martina Neuman, Anastasis Kratsios, Giulia Livieri, Luca Galimberti, Nils Detering","submitted_at":"2025-09-08T17:13:28Z","abstract_excerpt":"Since their introduction by Kipf and Welling in $2017$, a primary use of graph convolutional networks is transductive node classification, where missing labels are inferred within a single observed graph and its feature matrix. Despite the widespread use of the network model, the statistical foundations of transductive learning remain limited, as standard inference frameworks typically rely on multiple independent samples rather than a single graph. In this work, we address these gaps by developing new concentration-of-measure tools that leverage the geometric regularities of large graphs via "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06894","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/2509.06894/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":"2509.06894","created_at":"2026-07-05T12:06:54.686039+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.06894v1","created_at":"2026-07-05T12:06:54.686039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06894","created_at":"2026-07-05T12:06:54.686039+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGPWRSPRXDV6","created_at":"2026-07-05T12:06:54.686039+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGPWRSPRXDV6GDGK","created_at":"2026-07-05T12:06:54.686039+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGPWRSPR","created_at":"2026-07-05T12:06:54.686039+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/VGPWRSPRXDV6GDGKVXDYYJZCMY","json":"https://pith.science/pith/VGPWRSPRXDV6GDGKVXDYYJZCMY.json","graph_json":"https://pith.science/api/pith-number/VGPWRSPRXDV6GDGKVXDYYJZCMY/graph.json","events_json":"https://pith.science/api/pith-number/VGPWRSPRXDV6GDGKVXDYYJZCMY/events.json","paper":"https://pith.science/paper/VGPWRSPR"},"agent_actions":{"view_html":"https://pith.science/pith/VGPWRSPRXDV6GDGKVXDYYJZCMY","download_json":"https://pith.science/pith/VGPWRSPRXDV6GDGKVXDYYJZCMY.json","view_paper":"https://pith.science/paper/VGPWRSPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.06894&json=true","fetch_graph":"https://pith.science/api/pith-number/VGPWRSPRXDV6GDGKVXDYYJZCMY/graph.json","fetch_events":"https://pith.science/api/pith-number/VGPWRSPRXDV6GDGKVXDYYJZCMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGPWRSPRXDV6GDGKVXDYYJZCMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGPWRSPRXDV6GDGKVXDYYJZCMY/action/storage_attestation","attest_author":"https://pith.science/pith/VGPWRSPRXDV6GDGKVXDYYJZCMY/action/author_attestation","sign_citation":"https://pith.science/pith/VGPWRSPRXDV6GDGKVXDYYJZCMY/action/citation_signature","submit_replication":"https://pith.science/pith/VGPWRSPRXDV6GDGKVXDYYJZCMY/action/replication_record"}},"created_at":"2026-07-05T12:06:54.686039+00:00","updated_at":"2026-07-05T12:06:54.686039+00:00"}