{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TSQSNOZQWJCXEI7BE6QWOEJNTF","short_pith_number":"pith:TSQSNOZQ","schema_version":"1.0","canonical_sha256":"9ca126bb30b2457223e127a167112d995315c266580883f28cd8ff6372a92e4f","source":{"kind":"arxiv","id":"1704.06498","version":3},"attestation_state":"computed","paper":{"title":"Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Barbara Hammer, Benjamin Paa{\\ss}en, Christina G\\\"opfert","submitted_at":"2017-04-21T12:08:30Z","abstract_excerpt":"Graph models are relevant in many fields, such as distributed computing, intelligent tutoring systems or social network analysis. In many cases, such models need to take changes in the graph structure into account, i.e. a varying number of nodes or edges. Predicting such changes within graphs can be expected to yield important insight with respect to the underlying dynamics, e.g. with respect to user behaviour. However, predictive techniques in the past have almost exclusively focused on single edges or nodes. In this contribution, we attempt to predict the future state of a graph as a whole. "},"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":"1704.06498","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-21T12:08:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f947b09d5dd7ef88c63fa41a99ce9baba08379fcff7c393de2a175a05b0b0d31","abstract_canon_sha256":"8157c2ed555e6ca120bd1b50edded6fb98ca9edee69a5e4f1e1e2a075234e13b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:57.069799Z","signature_b64":"zO+Ru8XPSbVnQXv2esk5YGO+iU4+JHHtEkM6OO73mtIdh6B08682d6Pswh5B2cBO/nRJKSQknNANg4YM8KixDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ca126bb30b2457223e127a167112d995315c266580883f28cd8ff6372a92e4f","last_reissued_at":"2026-05-18T00:03:57.069147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:57.069147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Barbara Hammer, Benjamin Paa{\\ss}en, Christina G\\\"opfert","submitted_at":"2017-04-21T12:08:30Z","abstract_excerpt":"Graph models are relevant in many fields, such as distributed computing, intelligent tutoring systems or social network analysis. In many cases, such models need to take changes in the graph structure into account, i.e. a varying number of nodes or edges. Predicting such changes within graphs can be expected to yield important insight with respect to the underlying dynamics, e.g. with respect to user behaviour. However, predictive techniques in the past have almost exclusively focused on single edges or nodes. In this contribution, we attempt to predict the future state of a graph as a whole. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06498","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":""},"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":"1704.06498","created_at":"2026-05-18T00:03:57.069245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06498v3","created_at":"2026-05-18T00:03:57.069245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06498","created_at":"2026-05-18T00:03:57.069245+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSQSNOZQWJCX","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSQSNOZQWJCXEI7B","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSQSNOZQ","created_at":"2026-05-18T12:31:46.661854+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/TSQSNOZQWJCXEI7BE6QWOEJNTF","json":"https://pith.science/pith/TSQSNOZQWJCXEI7BE6QWOEJNTF.json","graph_json":"https://pith.science/api/pith-number/TSQSNOZQWJCXEI7BE6QWOEJNTF/graph.json","events_json":"https://pith.science/api/pith-number/TSQSNOZQWJCXEI7BE6QWOEJNTF/events.json","paper":"https://pith.science/paper/TSQSNOZQ"},"agent_actions":{"view_html":"https://pith.science/pith/TSQSNOZQWJCXEI7BE6QWOEJNTF","download_json":"https://pith.science/pith/TSQSNOZQWJCXEI7BE6QWOEJNTF.json","view_paper":"https://pith.science/paper/TSQSNOZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06498&json=true","fetch_graph":"https://pith.science/api/pith-number/TSQSNOZQWJCXEI7BE6QWOEJNTF/graph.json","fetch_events":"https://pith.science/api/pith-number/TSQSNOZQWJCXEI7BE6QWOEJNTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSQSNOZQWJCXEI7BE6QWOEJNTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSQSNOZQWJCXEI7BE6QWOEJNTF/action/storage_attestation","attest_author":"https://pith.science/pith/TSQSNOZQWJCXEI7BE6QWOEJNTF/action/author_attestation","sign_citation":"https://pith.science/pith/TSQSNOZQWJCXEI7BE6QWOEJNTF/action/citation_signature","submit_replication":"https://pith.science/pith/TSQSNOZQWJCXEI7BE6QWOEJNTF/action/replication_record"}},"created_at":"2026-05-18T00:03:57.069245+00:00","updated_at":"2026-05-18T00:03:57.069245+00:00"}