{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LZZ4OG4IQSSRKQPUFEKG6M76AS","short_pith_number":"pith:LZZ4OG4I","schema_version":"1.0","canonical_sha256":"5e73c71b8884a51541f429146f33fe04aa557437a31edd4577cbf13feb202dde","source":{"kind":"arxiv","id":"2312.02230","version":3},"attestation_state":"computed","paper":{"title":"A Simple and Scalable Representation for Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Seul Lee, Sungsoo Ahn, Yunhui Jang","submitted_at":"2023-12-04T03:43:26Z","abstract_excerpt":"Recently, there has been a surge of interest in employing neural networks for graph generation, a fundamental statistical learning problem with critical applications like molecule design and community analysis. However, most approaches encounter significant limitations when generating large-scale graphs. This is due to their requirement to output the full adjacency matrices whose size grows quadratically with the number of nodes. In response to this challenge, we introduce a new, simple, and scalable graph representation named gap encoded edge list (GEEL) that has a small representation size t"},"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":"2312.02230","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-04T03:43:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bc660d42bf92f053aca2e9aa9ed53f0e2e7cd80830e3fd50b15b4223597ce89d","abstract_canon_sha256":"c392d5de0f722670f15d2dd4bef657a251f885877f456cdeb6ef9f726fe60cc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:51.968602Z","signature_b64":"Z/j6fVH1ZIkw90dM2BSb9f76HCGSUbZ7bBvMs1CyiGzUMc65DkOPAxHDWnKGFN8/Ycs4AlorpOZ1muQlqjMYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e73c71b8884a51541f429146f33fe04aa557437a31edd4577cbf13feb202dde","last_reissued_at":"2026-07-05T08:49:51.968117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:51.968117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple and Scalable Representation for Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Seul Lee, Sungsoo Ahn, Yunhui Jang","submitted_at":"2023-12-04T03:43:26Z","abstract_excerpt":"Recently, there has been a surge of interest in employing neural networks for graph generation, a fundamental statistical learning problem with critical applications like molecule design and community analysis. However, most approaches encounter significant limitations when generating large-scale graphs. This is due to their requirement to output the full adjacency matrices whose size grows quadratically with the number of nodes. In response to this challenge, we introduce a new, simple, and scalable graph representation named gap encoded edge list (GEEL) that has a small representation size t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02230","kind":"arxiv","version":3},"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/2312.02230/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":"2312.02230","created_at":"2026-07-05T08:49:51.968174+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.02230v3","created_at":"2026-07-05T08:49:51.968174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02230","created_at":"2026-07-05T08:49:51.968174+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZZ4OG4IQSSR","created_at":"2026-07-05T08:49:51.968174+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZZ4OG4IQSSRKQPU","created_at":"2026-07-05T08:49:51.968174+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZZ4OG4I","created_at":"2026-07-05T08:49:51.968174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01073","citing_title":"Graph Generative Pre-trained Transformer","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS","json":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS.json","graph_json":"https://pith.science/api/pith-number/LZZ4OG4IQSSRKQPUFEKG6M76AS/graph.json","events_json":"https://pith.science/api/pith-number/LZZ4OG4IQSSRKQPUFEKG6M76AS/events.json","paper":"https://pith.science/paper/LZZ4OG4I"},"agent_actions":{"view_html":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS","download_json":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS.json","view_paper":"https://pith.science/paper/LZZ4OG4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.02230&json=true","fetch_graph":"https://pith.science/api/pith-number/LZZ4OG4IQSSRKQPUFEKG6M76AS/graph.json","fetch_events":"https://pith.science/api/pith-number/LZZ4OG4IQSSRKQPUFEKG6M76AS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS/action/storage_attestation","attest_author":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS/action/author_attestation","sign_citation":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS/action/citation_signature","submit_replication":"https://pith.science/pith/LZZ4OG4IQSSRKQPUFEKG6M76AS/action/replication_record"}},"created_at":"2026-07-05T08:49:51.968174+00:00","updated_at":"2026-07-05T08:49:51.968174+00:00"}