{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JONBFCQANXZTEKMSACGRJCCAOJ","short_pith_number":"pith:JONBFCQA","schema_version":"1.0","canonical_sha256":"4b9a128a006df3322992008d148840727dd385351973acf3f9dab5217256249f","source":{"kind":"arxiv","id":"1903.07299","version":1},"attestation_state":"computed","paper":{"title":"Autoregressive Models for Sequences of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cesare Alippi, Daniele Grattarola, Daniele Zambon, Lorenzo Livi","submitted_at":"2019-03-18T08:37:13Z","abstract_excerpt":"This paper proposes an autoregressive (AR) model for sequences of graphs, which generalises traditional AR models. A first novelty consists in formalising the AR model for a very general family of graphs, characterised by a variable topology, and attributes associated with nodes and edges. A graph neural network (GNN) is also proposed to learn the AR function associated with the graph-generating process (GGP), and subsequently predict the next graph in a sequence. The proposed method is compared with four baselines on synthetic GGPs, denoting a significantly better performance on all considere"},"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":"1903.07299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-18T08:37:13Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0329c09ca28de753586a9598f7f2140309623317e1d916d7363b446d575b60db","abstract_canon_sha256":"d0e2e489324059226f5d3334f0ca2c84710588df6e82e6cbf0ae0dc079570fba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.822112Z","signature_b64":"XOFzxorh/FuQVLwCD4aw+HmRznRFGyUt/dWg7oRqToCszYfV9BBJY2YTFOD2tarBtgeHXxcMo3IoWUuQ2F7ABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b9a128a006df3322992008d148840727dd385351973acf3f9dab5217256249f","last_reissued_at":"2026-05-17T23:51:01.821413Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.821413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Autoregressive Models for Sequences of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cesare Alippi, Daniele Grattarola, Daniele Zambon, Lorenzo Livi","submitted_at":"2019-03-18T08:37:13Z","abstract_excerpt":"This paper proposes an autoregressive (AR) model for sequences of graphs, which generalises traditional AR models. A first novelty consists in formalising the AR model for a very general family of graphs, characterised by a variable topology, and attributes associated with nodes and edges. A graph neural network (GNN) is also proposed to learn the AR function associated with the graph-generating process (GGP), and subsequently predict the next graph in a sequence. The proposed method is compared with four baselines on synthetic GGPs, denoting a significantly better performance on all considere"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07299","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":""},"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":"1903.07299","created_at":"2026-05-17T23:51:01.821557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07299v1","created_at":"2026-05-17T23:51:01.821557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07299","created_at":"2026-05-17T23:51:01.821557+00:00"},{"alias_kind":"pith_short_12","alias_value":"JONBFCQANXZT","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JONBFCQANXZTEKMS","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JONBFCQA","created_at":"2026-05-18T12:33:21.387695+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/JONBFCQANXZTEKMSACGRJCCAOJ","json":"https://pith.science/pith/JONBFCQANXZTEKMSACGRJCCAOJ.json","graph_json":"https://pith.science/api/pith-number/JONBFCQANXZTEKMSACGRJCCAOJ/graph.json","events_json":"https://pith.science/api/pith-number/JONBFCQANXZTEKMSACGRJCCAOJ/events.json","paper":"https://pith.science/paper/JONBFCQA"},"agent_actions":{"view_html":"https://pith.science/pith/JONBFCQANXZTEKMSACGRJCCAOJ","download_json":"https://pith.science/pith/JONBFCQANXZTEKMSACGRJCCAOJ.json","view_paper":"https://pith.science/paper/JONBFCQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07299&json=true","fetch_graph":"https://pith.science/api/pith-number/JONBFCQANXZTEKMSACGRJCCAOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JONBFCQANXZTEKMSACGRJCCAOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JONBFCQANXZTEKMSACGRJCCAOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JONBFCQANXZTEKMSACGRJCCAOJ/action/storage_attestation","attest_author":"https://pith.science/pith/JONBFCQANXZTEKMSACGRJCCAOJ/action/author_attestation","sign_citation":"https://pith.science/pith/JONBFCQANXZTEKMSACGRJCCAOJ/action/citation_signature","submit_replication":"https://pith.science/pith/JONBFCQANXZTEKMSACGRJCCAOJ/action/replication_record"}},"created_at":"2026-05-17T23:51:01.821557+00:00","updated_at":"2026-05-17T23:51:01.821557+00:00"}