{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D4NZZVPGLHOGNWBXOEA2PK7BPR","short_pith_number":"pith:D4NZZVPG","schema_version":"1.0","canonical_sha256":"1f1b9cd5e659dc66d8377101a7abe17c6888421a395030bdabbc5d23bf9f0361","source":{"kind":"arxiv","id":"2508.20706","version":1},"attestation_state":"computed","paper":{"title":"Renormalizable Graph Embeddings For Multi-Scale Network Reconstruction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","econ.GN","q-fin.EC"],"primary_cat":"physics.soc-ph","authors_text":"Diego Garlaschelli, Fabian Jansen, Riccardo Milocco","submitted_at":"2025-08-28T12:24:08Z","abstract_excerpt":"In machine learning, graph embedding algorithms seek low-dimensional representations of the input network data, thereby allowing for downstream tasks on compressed encodings. Recently, within the framework of network renormalization, multi-scale embeddings that remain consistent under an arbitrary aggregation of nodes onto block-nodes, and consequently under an arbitrary change of resolution of the input network data, have been proposed. Here we investigate such multi-scale graph embeddings in the modified context where the input network is not entirely observable, due to data limitations or p"},"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":"2508.20706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"physics.soc-ph","submitted_at":"2025-08-28T12:24:08Z","cross_cats_sorted":["cond-mat.dis-nn","econ.GN","q-fin.EC"],"title_canon_sha256":"081144877070354dfb2e0fae302a74a6ad397cb5e8a3acbc173268a61f66ccea","abstract_canon_sha256":"4710dcd48b3ea266909dfedcb89eb6d1a19e446a85690b099fd915ca814df5a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:58.324034Z","signature_b64":"tbVZPZl9Okz2lhAFMJJyB+IF3VvLvfKC9Lju5xdtZrITy6V9FVm9hkTKBBruHuJ6rlpQs8tZYQJefOjh9bo7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f1b9cd5e659dc66d8377101a7abe17c6888421a395030bdabbc5d23bf9f0361","last_reissued_at":"2026-07-05T12:00:58.323545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:58.323545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Renormalizable Graph Embeddings For Multi-Scale Network Reconstruction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","econ.GN","q-fin.EC"],"primary_cat":"physics.soc-ph","authors_text":"Diego Garlaschelli, Fabian Jansen, Riccardo Milocco","submitted_at":"2025-08-28T12:24:08Z","abstract_excerpt":"In machine learning, graph embedding algorithms seek low-dimensional representations of the input network data, thereby allowing for downstream tasks on compressed encodings. Recently, within the framework of network renormalization, multi-scale embeddings that remain consistent under an arbitrary aggregation of nodes onto block-nodes, and consequently under an arbitrary change of resolution of the input network data, have been proposed. Here we investigate such multi-scale graph embeddings in the modified context where the input network is not entirely observable, due to data limitations or p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20706","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/2508.20706/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":"2508.20706","created_at":"2026-07-05T12:00:58.323604+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.20706v1","created_at":"2026-07-05T12:00:58.323604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20706","created_at":"2026-07-05T12:00:58.323604+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4NZZVPGLHOG","created_at":"2026-07-05T12:00:58.323604+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4NZZVPGLHOGNWBX","created_at":"2026-07-05T12:00:58.323604+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4NZZVPG","created_at":"2026-07-05T12:00:58.323604+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/D4NZZVPGLHOGNWBXOEA2PK7BPR","json":"https://pith.science/pith/D4NZZVPGLHOGNWBXOEA2PK7BPR.json","graph_json":"https://pith.science/api/pith-number/D4NZZVPGLHOGNWBXOEA2PK7BPR/graph.json","events_json":"https://pith.science/api/pith-number/D4NZZVPGLHOGNWBXOEA2PK7BPR/events.json","paper":"https://pith.science/paper/D4NZZVPG"},"agent_actions":{"view_html":"https://pith.science/pith/D4NZZVPGLHOGNWBXOEA2PK7BPR","download_json":"https://pith.science/pith/D4NZZVPGLHOGNWBXOEA2PK7BPR.json","view_paper":"https://pith.science/paper/D4NZZVPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.20706&json=true","fetch_graph":"https://pith.science/api/pith-number/D4NZZVPGLHOGNWBXOEA2PK7BPR/graph.json","fetch_events":"https://pith.science/api/pith-number/D4NZZVPGLHOGNWBXOEA2PK7BPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4NZZVPGLHOGNWBXOEA2PK7BPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4NZZVPGLHOGNWBXOEA2PK7BPR/action/storage_attestation","attest_author":"https://pith.science/pith/D4NZZVPGLHOGNWBXOEA2PK7BPR/action/author_attestation","sign_citation":"https://pith.science/pith/D4NZZVPGLHOGNWBXOEA2PK7BPR/action/citation_signature","submit_replication":"https://pith.science/pith/D4NZZVPGLHOGNWBXOEA2PK7BPR/action/replication_record"}},"created_at":"2026-07-05T12:00:58.323604+00:00","updated_at":"2026-07-05T12:00:58.323604+00:00"}