{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:GMHZV3PKBJS74ZWESPXFCKQALD","short_pith_number":"pith:GMHZV3PK","canonical_record":{"source":{"id":"2110.11017","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-21T09:46:44Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"55dca4325b0a33ece5580fae832f37fff6f93ad5313ae51d875fefa2350dfe46","abstract_canon_sha256":"370f104d4f4100da1b33c5bd64553e9ced04e4eecf405311d48a621a42418862"},"schema_version":"1.0"},"canonical_sha256":"330f9aedea0a65fe66c493ee512a0058c221fca381fcda7ab446f23df5ece9d6","source":{"kind":"arxiv","id":"2110.11017","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.11017","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"2110.11017v2","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11017","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"GMHZV3PKBJS7","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"GMHZV3PKBJS74ZWE","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"GMHZV3PK","created_at":"2026-07-05T04:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:GMHZV3PKBJS74ZWESPXFCKQALD","target":"record","payload":{"canonical_record":{"source":{"id":"2110.11017","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-21T09:46:44Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"55dca4325b0a33ece5580fae832f37fff6f93ad5313ae51d875fefa2350dfe46","abstract_canon_sha256":"370f104d4f4100da1b33c5bd64553e9ced04e4eecf405311d48a621a42418862"},"schema_version":"1.0"},"canonical_sha256":"330f9aedea0a65fe66c493ee512a0058c221fca381fcda7ab446f23df5ece9d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:47.413398Z","signature_b64":"iK7eAfFp8n9n3SCZe/40jPKViqBhefRxmeSapS8t/uNPRGg/FF0YU8vLge9c+0lzuZGsWKFaEbGDgLMEE+LMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330f9aedea0a65fe66c493ee512a0058c221fca381fcda7ab446f23df5ece9d6","last_reissued_at":"2026-07-05T04:25:47.412863Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:47.412863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.11017","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PB95G7odSxBCLCpHZL8rHwyVDfFF9M5Cx1SScT1ybmY87S9s9kLXoP+j12rVkdTSpJPFkK3v0lE1SrFBnTP+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:00:52.934003Z"},"content_sha256":"5f6663b2f6e0e53702ce5fbc4fa1e0a6ca69c65cd11ef2d6c289c3c40a4adb13","schema_version":"1.0","event_id":"sha256:5f6663b2f6e0e53702ce5fbc4fa1e0a6ca69c65cd11ef2d6c289c3c40a4adb13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:GMHZV3PKBJS74ZWESPXFCKQALD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Time-Varying Graphs from Online Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Alberto Natali, Elvin Isufi, Geert Leus, Mario Coutino","submitted_at":"2021-10-21T09:46:44Z","abstract_excerpt":"This work proposes an algorithmic framework to learn time-varying graphs from online data. The generality offered by the framework renders it model-independent, i.e., it can be theoretically analyzed in its abstract formulation and then instantiated under a variety of model-dependent graph learning problems. This is possible by phrasing (time-varying) graph learning as a composite optimization problem, where different functions regulate different desiderata, e.g., data fidelity, sparsity or smoothness. Instrumental for the findings is recognizing that the dependence of the majority (if not all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11017","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/2110.11017/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HG+GtIjsbt+nAVddSxbhTuIeXuYSov1ZEU9aBLTZK943sluPYb1m77nz06hr2jrxfgkX51NfrpI6mqCHw4cMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:00:52.934388Z"},"content_sha256":"2d486f273275acd71a91ec695a8597890e1041c136aecb8f26d68f33587021b2","schema_version":"1.0","event_id":"sha256:2d486f273275acd71a91ec695a8597890e1041c136aecb8f26d68f33587021b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMHZV3PKBJS74ZWESPXFCKQALD/bundle.json","state_url":"https://pith.science/pith/GMHZV3PKBJS74ZWESPXFCKQALD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMHZV3PKBJS74ZWESPXFCKQALD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T21:00:52Z","links":{"resolver":"https://pith.science/pith/GMHZV3PKBJS74ZWESPXFCKQALD","bundle":"https://pith.science/pith/GMHZV3PKBJS74ZWESPXFCKQALD/bundle.json","state":"https://pith.science/pith/GMHZV3PKBJS74ZWESPXFCKQALD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMHZV3PKBJS74ZWESPXFCKQALD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:GMHZV3PKBJS74ZWESPXFCKQALD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"370f104d4f4100da1b33c5bd64553e9ced04e4eecf405311d48a621a42418862","cross_cats_sorted":["eess.SP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-21T09:46:44Z","title_canon_sha256":"55dca4325b0a33ece5580fae832f37fff6f93ad5313ae51d875fefa2350dfe46"},"schema_version":"1.0","source":{"id":"2110.11017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.11017","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"2110.11017v2","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11017","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"GMHZV3PKBJS7","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"GMHZV3PKBJS74ZWE","created_at":"2026-07-05T04:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"GMHZV3PK","created_at":"2026-07-05T04:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:2d486f273275acd71a91ec695a8597890e1041c136aecb8f26d68f33587021b2","target":"graph","created_at":"2026-07-05T04:25:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.11017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work proposes an algorithmic framework to learn time-varying graphs from online data. The generality offered by the framework renders it model-independent, i.e., it can be theoretically analyzed in its abstract formulation and then instantiated under a variety of model-dependent graph learning problems. This is possible by phrasing (time-varying) graph learning as a composite optimization problem, where different functions regulate different desiderata, e.g., data fidelity, sparsity or smoothness. Instrumental for the findings is recognizing that the dependence of the majority (if not all","authors_text":"Alberto Natali, Elvin Isufi, Geert Leus, Mario Coutino","cross_cats":["eess.SP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-21T09:46:44Z","title":"Learning Time-Varying Graphs from Online Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11017","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5f6663b2f6e0e53702ce5fbc4fa1e0a6ca69c65cd11ef2d6c289c3c40a4adb13","target":"record","created_at":"2026-07-05T04:25:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"370f104d4f4100da1b33c5bd64553e9ced04e4eecf405311d48a621a42418862","cross_cats_sorted":["eess.SP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-21T09:46:44Z","title_canon_sha256":"55dca4325b0a33ece5580fae832f37fff6f93ad5313ae51d875fefa2350dfe46"},"schema_version":"1.0","source":{"id":"2110.11017","kind":"arxiv","version":2}},"canonical_sha256":"330f9aedea0a65fe66c493ee512a0058c221fca381fcda7ab446f23df5ece9d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"330f9aedea0a65fe66c493ee512a0058c221fca381fcda7ab446f23df5ece9d6","first_computed_at":"2026-07-05T04:25:47.412863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:25:47.412863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iK7eAfFp8n9n3SCZe/40jPKViqBhefRxmeSapS8t/uNPRGg/FF0YU8vLge9c+0lzuZGsWKFaEbGDgLMEE+LMBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:25:47.413398Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.11017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f6663b2f6e0e53702ce5fbc4fa1e0a6ca69c65cd11ef2d6c289c3c40a4adb13","sha256:2d486f273275acd71a91ec695a8597890e1041c136aecb8f26d68f33587021b2"],"state_sha256":"741aba45ecb377fe56187fbe3787650c0b713579b3151a86aca93dd9787fc332"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyXY+x4RcTEMMRwyiUEzj2fBUPElVvjqt/XDs4PJMgD5SUP8IHoQHbHu6HZmEbKELxz4pAAwi6asnR6BVY7XAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T21:00:52.936971Z","bundle_sha256":"592dc6e634c32253617ab93fad804e317eb32c9deed58827b0ee7379ed6c52de"}}