{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5TMKWNDBHBNKXCOSXGOZF7LPAD","short_pith_number":"pith:5TMKWNDB","schema_version":"1.0","canonical_sha256":"ecd8ab3461385aab89d2b99d92fd6f00cb05a93495f782c33207c507fa4caf74","source":{"kind":"arxiv","id":"2305.15562","version":1},"attestation_state":"computed","paper":{"title":"Let There Be Order: Rethinking Ordering in Autoregressive Graph Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Anuj Karpatne, Jie Bu, Kazi Sajeed Mehrab","submitted_at":"2023-05-24T20:52:34Z","abstract_excerpt":"Conditional graph generation tasks involve training a model to generate a graph given a set of input conditions. Many previous studies employ autoregressive models to incrementally generate graph components such as nodes and edges. However, as graphs typically lack a natural ordering among their components, converting a graph into a sequence of tokens is not straightforward. While prior works mostly rely on conventional heuristics or graph traversal methods like breadth-first search (BFS) or depth-first search (DFS) to convert graphs to sequences, the impact of ordering on graph generation has"},"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":"2305.15562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-24T20:52:34Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"31368d1cfe912467e90a7b6f9fff45ca1e13a6fd06d44b903dd21f55e472cfa4","abstract_canon_sha256":"1134a320713eb2027b00dab3672fe24ceb2b37e4b79bd0f54f899b84347166db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:41.912831Z","signature_b64":"SKKASrs1iVXEa+zGO/D+pp5n47vfalQ8ZlHr1eybKGabztaw4BU6W9GEgMBmv2GO5gXMBaGfDBc+CkKKBaqDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecd8ab3461385aab89d2b99d92fd6f00cb05a93495f782c33207c507fa4caf74","last_reissued_at":"2026-07-05T06:13:41.912264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:41.912264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Let There Be Order: Rethinking Ordering in Autoregressive Graph Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Anuj Karpatne, Jie Bu, Kazi Sajeed Mehrab","submitted_at":"2023-05-24T20:52:34Z","abstract_excerpt":"Conditional graph generation tasks involve training a model to generate a graph given a set of input conditions. Many previous studies employ autoregressive models to incrementally generate graph components such as nodes and edges. However, as graphs typically lack a natural ordering among their components, converting a graph into a sequence of tokens is not straightforward. While prior works mostly rely on conventional heuristics or graph traversal methods like breadth-first search (BFS) or depth-first search (DFS) to convert graphs to sequences, the impact of ordering on graph generation has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.15562","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/2305.15562/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":"2305.15562","created_at":"2026-07-05T06:13:41.912325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.15562v1","created_at":"2026-07-05T06:13:41.912325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.15562","created_at":"2026-07-05T06:13:41.912325+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TMKWNDBHBNK","created_at":"2026-07-05T06:13:41.912325+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TMKWNDBHBNKXCOS","created_at":"2026-07-05T06:13:41.912325+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TMKWNDB","created_at":"2026-07-05T06:13:41.912325+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04287","citing_title":"Scaling Novel Graph Generation via Lightweight Structure-Guided Autoregressive Models","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD","json":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD.json","graph_json":"https://pith.science/api/pith-number/5TMKWNDBHBNKXCOSXGOZF7LPAD/graph.json","events_json":"https://pith.science/api/pith-number/5TMKWNDBHBNKXCOSXGOZF7LPAD/events.json","paper":"https://pith.science/paper/5TMKWNDB"},"agent_actions":{"view_html":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD","download_json":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD.json","view_paper":"https://pith.science/paper/5TMKWNDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.15562&json=true","fetch_graph":"https://pith.science/api/pith-number/5TMKWNDBHBNKXCOSXGOZF7LPAD/graph.json","fetch_events":"https://pith.science/api/pith-number/5TMKWNDBHBNKXCOSXGOZF7LPAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD/action/storage_attestation","attest_author":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD/action/author_attestation","sign_citation":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD/action/citation_signature","submit_replication":"https://pith.science/pith/5TMKWNDBHBNKXCOSXGOZF7LPAD/action/replication_record"}},"created_at":"2026-07-05T06:13:41.912325+00:00","updated_at":"2026-07-05T06:13:41.912325+00:00"}