{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:J4ZH2JOEF34M27LJUDPBQ33IFT","short_pith_number":"pith:J4ZH2JOE","schema_version":"1.0","canonical_sha256":"4f327d25c42ef8cd7d69a0de186f682ceb22bedf14eafc919d3fbfc3837b1dd3","source":{"kind":"arxiv","id":"2301.10857","version":2},"attestation_state":"computed","paper":{"title":"Improving Graph Generation by Restricting Graph Bandwidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Alex M. Tseng, Gabriele Scalia, Kangway V. Chuang, Nathaniel Diamant, Tommaso Biancalani","submitted_at":"2023-01-25T22:27:46Z","abstract_excerpt":"Deep graph generative modeling has proven capable of learning the distribution of complex, multi-scale structures characterizing real-world graphs. However, one of the main limitations of existing methods is their large output space, which limits generation scalability and hinders accurate modeling of the underlying distribution. To overcome these limitations, we propose a novel approach that significantly reduces the output space of existing graph generative models. Specifically, starting from the observation that many real-world graphs have low graph bandwidth, we restrict graph bandwidth du"},"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":"2301.10857","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-25T22:27:46Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"1786fbb3c9ed965bcc21ff87eb40b96f94195ce460ff3730cfbda701de41f7e1","abstract_canon_sha256":"f519ab2a53aa4f20ac0cf3d96c1487dc83f3605e660c381e6855c37766173275"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:15:45.123434Z","signature_b64":"NjXaFrkpO9hQJ4t6waNSvXt+9rb/yXbMByO9/U9IuYYOjkbKt/6J5a24m9EzV0Pf4eozZrVWqXaqSkGs5yg3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f327d25c42ef8cd7d69a0de186f682ceb22bedf14eafc919d3fbfc3837b1dd3","last_reissued_at":"2026-07-05T06:15:45.123012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:15:45.123012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Graph Generation by Restricting Graph Bandwidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Alex M. Tseng, Gabriele Scalia, Kangway V. Chuang, Nathaniel Diamant, Tommaso Biancalani","submitted_at":"2023-01-25T22:27:46Z","abstract_excerpt":"Deep graph generative modeling has proven capable of learning the distribution of complex, multi-scale structures characterizing real-world graphs. However, one of the main limitations of existing methods is their large output space, which limits generation scalability and hinders accurate modeling of the underlying distribution. To overcome these limitations, we propose a novel approach that significantly reduces the output space of existing graph generative models. Specifically, starting from the observation that many real-world graphs have low graph bandwidth, we restrict graph bandwidth du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10857","kind":"arxiv","version":2},"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/2301.10857/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":"2301.10857","created_at":"2026-07-05T06:15:45.123063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.10857v2","created_at":"2026-07-05T06:15:45.123063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10857","created_at":"2026-07-05T06:15:45.123063+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4ZH2JOEF34M","created_at":"2026-07-05T06:15:45.123063+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4ZH2JOEF34M27LJ","created_at":"2026-07-05T06:15:45.123063+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4ZH2JOE","created_at":"2026-07-05T06:15:45.123063+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/J4ZH2JOEF34M27LJUDPBQ33IFT","json":"https://pith.science/pith/J4ZH2JOEF34M27LJUDPBQ33IFT.json","graph_json":"https://pith.science/api/pith-number/J4ZH2JOEF34M27LJUDPBQ33IFT/graph.json","events_json":"https://pith.science/api/pith-number/J4ZH2JOEF34M27LJUDPBQ33IFT/events.json","paper":"https://pith.science/paper/J4ZH2JOE"},"agent_actions":{"view_html":"https://pith.science/pith/J4ZH2JOEF34M27LJUDPBQ33IFT","download_json":"https://pith.science/pith/J4ZH2JOEF34M27LJUDPBQ33IFT.json","view_paper":"https://pith.science/paper/J4ZH2JOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.10857&json=true","fetch_graph":"https://pith.science/api/pith-number/J4ZH2JOEF34M27LJUDPBQ33IFT/graph.json","fetch_events":"https://pith.science/api/pith-number/J4ZH2JOEF34M27LJUDPBQ33IFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4ZH2JOEF34M27LJUDPBQ33IFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4ZH2JOEF34M27LJUDPBQ33IFT/action/storage_attestation","attest_author":"https://pith.science/pith/J4ZH2JOEF34M27LJUDPBQ33IFT/action/author_attestation","sign_citation":"https://pith.science/pith/J4ZH2JOEF34M27LJUDPBQ33IFT/action/citation_signature","submit_replication":"https://pith.science/pith/J4ZH2JOEF34M27LJUDPBQ33IFT/action/replication_record"}},"created_at":"2026-07-05T06:15:45.123063+00:00","updated_at":"2026-07-05T06:15:45.123063+00:00"}