{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5OZNGGB5GXMNNDOKJJSWCBDHXV","short_pith_number":"pith:5OZNGGB5","canonical_record":{"source":{"id":"1205.1406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-07T14:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"60f3796d64f3329cd2ccdc8dc60ca84d92cb8d541ee0b93ef2a2bdf891c048bc","abstract_canon_sha256":"87ce688bc7a23eeb399e4580c309a02fa37bac5fcc7c6c6f6edaacb5d579919b"},"schema_version":"1.0"},"canonical_sha256":"ebb2d3183d35d8d68dca4a65610467bd690cf618cb3c5acecbb2b653f7efd741","source":{"kind":"arxiv","id":"1205.1406","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1406","created_at":"2026-05-18T03:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1406v2","created_at":"2026-05-18T03:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1406","created_at":"2026-05-18T03:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"5OZNGGB5GXMN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5OZNGGB5GXMNNDOK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5OZNGGB5","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5OZNGGB5GXMNNDOKJJSWCBDHXV","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-07T14:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"60f3796d64f3329cd2ccdc8dc60ca84d92cb8d541ee0b93ef2a2bdf891c048bc","abstract_canon_sha256":"87ce688bc7a23eeb399e4580c309a02fa37bac5fcc7c6c6f6edaacb5d579919b"},"schema_version":"1.0"},"canonical_sha256":"ebb2d3183d35d8d68dca4a65610467bd690cf618cb3c5acecbb2b653f7efd741","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:58.657111Z","signature_b64":"TdjDgLONBxSr2b5OPKm0GEFqxmT9S8OqeikaG4sSUrFqaT28AUDx//JzSDTDASgfSIQyGx8jX3GcSJBsmDlcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb2d3183d35d8d68dca4a65610467bd690cf618cb3c5acecbb2b653f7efd741","last_reissued_at":"2026-05-18T03:55:58.656479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:58.656479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1406","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-05-18T03:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0auZUL1R4Bw1/XAMzYQbxPJUVgpj9TqC2LJb74fB1MoYz4JgJBdxvsDw8i5uqRaTqqbJZKyZD2L+0XFXjPYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:17:55.403827Z"},"content_sha256":"c1aea276909d0798c181ed77df4ff063f05d24e1a1d23c04e5b6c5b7474e8968","schema_version":"1.0","event_id":"sha256:c1aea276909d0798c181ed77df4ff063f05d24e1a1d23c04e5b6c5b7474e8968"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5OZNGGB5GXMNNDOKJJSWCBDHXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Prediction in a Low-Rank and Autoregressive Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Emile Richard, Nicolas Vayatis, Pierre-Andre Savalle","submitted_at":"2012-05-07T14:24:24Z","abstract_excerpt":"We study the problem of prediction for evolving graph data. We formulate the problem as the minimization of a convex objective encouraging sparsity and low-rank of the solution, that reflect natural graph properties. The convex formulation allows to obtain oracle inequalities and efficient solvers. We provide empirical results for our algorithm and comparison with competing methods, and point out two open questions related to compressed sensing and algebra of low-rank and sparse matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1406","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":""},"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-05-18T03:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNqLrrWRVIXMVPhXrFv75WMNuMfxx5w7Uc3Ed0F6drz5vjVIQFX6yO172yf7p/SMrqRFla+//rNdbXrlXeN7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:17:55.404188Z"},"content_sha256":"cffa1c790679c8a914f23075d8c46454ac963c302dae87e09a3299e942cf6966","schema_version":"1.0","event_id":"sha256:cffa1c790679c8a914f23075d8c46454ac963c302dae87e09a3299e942cf6966"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OZNGGB5GXMNNDOKJJSWCBDHXV/bundle.json","state_url":"https://pith.science/pith/5OZNGGB5GXMNNDOKJJSWCBDHXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OZNGGB5GXMNNDOKJJSWCBDHXV/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-05-27T16:17:55Z","links":{"resolver":"https://pith.science/pith/5OZNGGB5GXMNNDOKJJSWCBDHXV","bundle":"https://pith.science/pith/5OZNGGB5GXMNNDOKJJSWCBDHXV/bundle.json","state":"https://pith.science/pith/5OZNGGB5GXMNNDOKJJSWCBDHXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OZNGGB5GXMNNDOKJJSWCBDHXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5OZNGGB5GXMNNDOKJJSWCBDHXV","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":"87ce688bc7a23eeb399e4580c309a02fa37bac5fcc7c6c6f6edaacb5d579919b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-07T14:24:24Z","title_canon_sha256":"60f3796d64f3329cd2ccdc8dc60ca84d92cb8d541ee0b93ef2a2bdf891c048bc"},"schema_version":"1.0","source":{"id":"1205.1406","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1406","created_at":"2026-05-18T03:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1406v2","created_at":"2026-05-18T03:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1406","created_at":"2026-05-18T03:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"5OZNGGB5GXMN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5OZNGGB5GXMNNDOK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5OZNGGB5","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:cffa1c790679c8a914f23075d8c46454ac963c302dae87e09a3299e942cf6966","target":"graph","created_at":"2026-05-18T03:55:58Z","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"},"paper":{"abstract_excerpt":"We study the problem of prediction for evolving graph data. We formulate the problem as the minimization of a convex objective encouraging sparsity and low-rank of the solution, that reflect natural graph properties. The convex formulation allows to obtain oracle inequalities and efficient solvers. We provide empirical results for our algorithm and comparison with competing methods, and point out two open questions related to compressed sensing and algebra of low-rank and sparse matrices.","authors_text":"Emile Richard, Nicolas Vayatis, Pierre-Andre Savalle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-07T14:24:24Z","title":"Graph Prediction in a Low-Rank and Autoregressive Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1406","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:c1aea276909d0798c181ed77df4ff063f05d24e1a1d23c04e5b6c5b7474e8968","target":"record","created_at":"2026-05-18T03:55:58Z","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":"87ce688bc7a23eeb399e4580c309a02fa37bac5fcc7c6c6f6edaacb5d579919b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-07T14:24:24Z","title_canon_sha256":"60f3796d64f3329cd2ccdc8dc60ca84d92cb8d541ee0b93ef2a2bdf891c048bc"},"schema_version":"1.0","source":{"id":"1205.1406","kind":"arxiv","version":2}},"canonical_sha256":"ebb2d3183d35d8d68dca4a65610467bd690cf618cb3c5acecbb2b653f7efd741","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebb2d3183d35d8d68dca4a65610467bd690cf618cb3c5acecbb2b653f7efd741","first_computed_at":"2026-05-18T03:55:58.656479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:58.656479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TdjDgLONBxSr2b5OPKm0GEFqxmT9S8OqeikaG4sSUrFqaT28AUDx//JzSDTDASgfSIQyGx8jX3GcSJBsmDlcDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:58.657111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1406","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1aea276909d0798c181ed77df4ff063f05d24e1a1d23c04e5b6c5b7474e8968","sha256:cffa1c790679c8a914f23075d8c46454ac963c302dae87e09a3299e942cf6966"],"state_sha256":"0ebed8dec7cf39c7ecbd775cd9b799dcfbccc022a2b5caaa0d7bbe0a084a4311"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9EErq26MGnjTwOu6JPJXNCi8oAt1xbd11W5KMjs96Ma7ghzJQtvNCg4a6gM5SitOoWlpBUcYDFdYR+ev04tBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:17:55.406701Z","bundle_sha256":"1b9275f286e64a494c3769567fe90e96f8ead1e87207be6f7a4b9a04ee32cd85"}}