{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WTQF3JNKG2V7JG22Q3TLXPY3VS","short_pith_number":"pith:WTQF3JNK","canonical_record":{"source":{"id":"1506.06962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-23T12:12:45Z","cross_cats_sorted":["cs.LG","cs.SI","physics.soc-ph"],"title_canon_sha256":"f025468635f2de76261c2f6e84f14085848e9e2a425f7ec9541e151cbc0486fc","abstract_canon_sha256":"b29ccce080fa5b63922e6eb7ac63be70b59e64114140281fdecaeeabbe87750b"},"schema_version":"1.0"},"canonical_sha256":"b4e05da5aa36abf49b5a86e6bbbf1baca005755a691990c0ab9ce477edf3ec7f","source":{"kind":"arxiv","id":"1506.06962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06962","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06962v1","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06962","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"WTQF3JNKG2V7","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WTQF3JNKG2V7JG22","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WTQF3JNK","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WTQF3JNKG2V7JG22Q3TLXPY3VS","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-23T12:12:45Z","cross_cats_sorted":["cs.LG","cs.SI","physics.soc-ph"],"title_canon_sha256":"f025468635f2de76261c2f6e84f14085848e9e2a425f7ec9541e151cbc0486fc","abstract_canon_sha256":"b29ccce080fa5b63922e6eb7ac63be70b59e64114140281fdecaeeabbe87750b"},"schema_version":"1.0"},"canonical_sha256":"b4e05da5aa36abf49b5a86e6bbbf1baca005755a691990c0ab9ce477edf3ec7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:55.470508Z","signature_b64":"7y3LQ4fGR8EIZPR/ugAd5DFQfFNtNKxy96wTSPqLWARqsZXp6fE3mgJKy+rAtLATK60/84HO7qHhsJLwK/sNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4e05da5aa36abf49b5a86e6bbbf1baca005755a691990c0ab9ce477edf3ec7f","last_reissued_at":"2026-05-18T01:40:55.469782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:55.469782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06962","source_version":1,"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-18T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJJdyTftjNKegzxGRA3MTet2Rze7WC6v/Mgs8eGkQmEtFiLMbZxlIIe0KwbZAFlc+iB3Vw1h0es3mnNNzfrCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:09:35.495202Z"},"content_sha256":"eca101232d61455ed7886a6aac3ae7e713e9a014fbc38e34150c72d86735f130","schema_version":"1.0","event_id":"sha256:eca101232d61455ed7886a6aac3ae7e713e9a014fbc38e34150c72d86735f130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WTQF3JNKG2V7JG22Q3TLXPY3VS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs in machine learning: an introduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","physics.soc-ph"],"primary_cat":"stat.ML","authors_text":"Fabrice Rossi (SAMM), Pierre Latouche (SAMM)","submitted_at":"2015-06-23T12:12:45Z","abstract_excerpt":"Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper, we give an introduction to some methods relying on graphs for learning. This includes both unsupervised and supervised methods. Unsupervised learning algorithms usually aim at visualising graphs in latent spaces and/or clustering the nodes. Both focus on extracting knowledge from graph topologies. While most existing techniques are only applicable to static g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06962","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"},"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-18T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iu22JpaPYHtnW2BkGL3l5arns+hl0ZaOtrObH8IDDWUr33M3MTGoksNOu2jvV65nlV4t6uAt6FQXmkRTA6I5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:09:35.495845Z"},"content_sha256":"6c11ca22bb7fe86a3ec85b8cad37743522de96146237597095dbcffd42e9f529","schema_version":"1.0","event_id":"sha256:6c11ca22bb7fe86a3ec85b8cad37743522de96146237597095dbcffd42e9f529"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTQF3JNKG2V7JG22Q3TLXPY3VS/bundle.json","state_url":"https://pith.science/pith/WTQF3JNKG2V7JG22Q3TLXPY3VS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTQF3JNKG2V7JG22Q3TLXPY3VS/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-26T00:09:35Z","links":{"resolver":"https://pith.science/pith/WTQF3JNKG2V7JG22Q3TLXPY3VS","bundle":"https://pith.science/pith/WTQF3JNKG2V7JG22Q3TLXPY3VS/bundle.json","state":"https://pith.science/pith/WTQF3JNKG2V7JG22Q3TLXPY3VS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTQF3JNKG2V7JG22Q3TLXPY3VS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WTQF3JNKG2V7JG22Q3TLXPY3VS","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":"b29ccce080fa5b63922e6eb7ac63be70b59e64114140281fdecaeeabbe87750b","cross_cats_sorted":["cs.LG","cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-23T12:12:45Z","title_canon_sha256":"f025468635f2de76261c2f6e84f14085848e9e2a425f7ec9541e151cbc0486fc"},"schema_version":"1.0","source":{"id":"1506.06962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06962","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06962v1","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06962","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"WTQF3JNKG2V7","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WTQF3JNKG2V7JG22","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WTQF3JNK","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:6c11ca22bb7fe86a3ec85b8cad37743522de96146237597095dbcffd42e9f529","target":"graph","created_at":"2026-05-18T01:40:55Z","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":"Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper, we give an introduction to some methods relying on graphs for learning. This includes both unsupervised and supervised methods. Unsupervised learning algorithms usually aim at visualising graphs in latent spaces and/or clustering the nodes. Both focus on extracting knowledge from graph topologies. While most existing techniques are only applicable to static g","authors_text":"Fabrice Rossi (SAMM), Pierre Latouche (SAMM)","cross_cats":["cs.LG","cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-23T12:12:45Z","title":"Graphs in machine learning: an introduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06962","kind":"arxiv","version":1},"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:eca101232d61455ed7886a6aac3ae7e713e9a014fbc38e34150c72d86735f130","target":"record","created_at":"2026-05-18T01:40:55Z","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":"b29ccce080fa5b63922e6eb7ac63be70b59e64114140281fdecaeeabbe87750b","cross_cats_sorted":["cs.LG","cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-23T12:12:45Z","title_canon_sha256":"f025468635f2de76261c2f6e84f14085848e9e2a425f7ec9541e151cbc0486fc"},"schema_version":"1.0","source":{"id":"1506.06962","kind":"arxiv","version":1}},"canonical_sha256":"b4e05da5aa36abf49b5a86e6bbbf1baca005755a691990c0ab9ce477edf3ec7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4e05da5aa36abf49b5a86e6bbbf1baca005755a691990c0ab9ce477edf3ec7f","first_computed_at":"2026-05-18T01:40:55.469782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:40:55.469782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7y3LQ4fGR8EIZPR/ugAd5DFQfFNtNKxy96wTSPqLWARqsZXp6fE3mgJKy+rAtLATK60/84HO7qHhsJLwK/sNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:40:55.470508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eca101232d61455ed7886a6aac3ae7e713e9a014fbc38e34150c72d86735f130","sha256:6c11ca22bb7fe86a3ec85b8cad37743522de96146237597095dbcffd42e9f529"],"state_sha256":"1657d7cbea577c351ab6ede69de8e446e813c5f6a05ba107a3c6925d62066ebf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kfsns7Z+pCndoulnas7EZf+Xm0TouyxZr1PdQpUFFP9Xixv+GFcSgdBsQp1+ng9Wbsk61+JtgAqz6Q6gJKlGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:09:35.499349Z","bundle_sha256":"cde6dff564d4fc39c160896d7221132f782f74ed0a137ba8e2eb2f58722d78ea"}}