{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XZP4PRT7A2OZN2HI6NBGGDL3ER","short_pith_number":"pith:XZP4PRT7","schema_version":"1.0","canonical_sha256":"be5fc7c67f069d96e8e8f342630d7b246fbd8d9283d96d69ae3a43cf853f9097","source":{"kind":"arxiv","id":"1801.07351","version":2},"attestation_state":"computed","paper":{"title":"Tracking network dynamics: a survey of distances and similarity metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.AP","authors_text":"Claire Donnat, Susan Holmes","submitted_at":"2018-01-22T23:53:55Z","abstract_excerpt":"From longitudinal biomedical studies to social networks, graphs have emerged as a powerful framework for describing evolving interactions between agents in complex systems. In such studies, after pre-processing, the data can be represented by a set of graphs, each representing a system's state at different points in time. The analysis of the system's dynamics depends on the selection of the appropriate analytical tools. After characterizing similarities between states, a critical step lies in the choice of a distance between graphs capable of reflecting such similarities. While the literature "},"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":"1801.07351","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2018-01-22T23:53:55Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"47077f1549f9a64cd9761e4e61ba0a0e54d04b49f77e91d5b60f5832a9e635ee","abstract_canon_sha256":"0f1bf0969df69dbb9213a9cb29dd18b43ce802def90d48bb2d7d6315a8078452"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:40.339732Z","signature_b64":"VelJ4Q/YgFFR41QI5raFmTISfQf1R8OstmD3RQLBmMHjlqZWevjTqj2ZGcamZ7I5ImUxx/g5fsfrWXzdytUlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be5fc7c67f069d96e8e8f342630d7b246fbd8d9283d96d69ae3a43cf853f9097","last_reissued_at":"2026-05-18T00:21:40.339012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:40.339012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tracking network dynamics: a survey of distances and similarity metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.AP","authors_text":"Claire Donnat, Susan Holmes","submitted_at":"2018-01-22T23:53:55Z","abstract_excerpt":"From longitudinal biomedical studies to social networks, graphs have emerged as a powerful framework for describing evolving interactions between agents in complex systems. In such studies, after pre-processing, the data can be represented by a set of graphs, each representing a system's state at different points in time. The analysis of the system's dynamics depends on the selection of the appropriate analytical tools. After characterizing similarities between states, a critical step lies in the choice of a distance between graphs capable of reflecting such similarities. While the literature "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07351","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.07351","created_at":"2026-05-18T00:21:40.339134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07351v2","created_at":"2026-05-18T00:21:40.339134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07351","created_at":"2026-05-18T00:21:40.339134+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZP4PRT7A2OZ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZP4PRT7A2OZN2HI","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZP4PRT7","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15123","citing_title":"Spectral Effects Of Heavy-Tailed Vertex Noise In Geometric Graphs","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER","json":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER.json","graph_json":"https://pith.science/api/pith-number/XZP4PRT7A2OZN2HI6NBGGDL3ER/graph.json","events_json":"https://pith.science/api/pith-number/XZP4PRT7A2OZN2HI6NBGGDL3ER/events.json","paper":"https://pith.science/paper/XZP4PRT7"},"agent_actions":{"view_html":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER","download_json":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER.json","view_paper":"https://pith.science/paper/XZP4PRT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07351&json=true","fetch_graph":"https://pith.science/api/pith-number/XZP4PRT7A2OZN2HI6NBGGDL3ER/graph.json","fetch_events":"https://pith.science/api/pith-number/XZP4PRT7A2OZN2HI6NBGGDL3ER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER/action/storage_attestation","attest_author":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER/action/author_attestation","sign_citation":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER/action/citation_signature","submit_replication":"https://pith.science/pith/XZP4PRT7A2OZN2HI6NBGGDL3ER/action/replication_record"}},"created_at":"2026-05-18T00:21:40.339134+00:00","updated_at":"2026-05-18T00:21:40.339134+00:00"}