{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PF7XAD2RFADCF3YTBB3D2TIIKU","short_pith_number":"pith:PF7XAD2R","schema_version":"1.0","canonical_sha256":"797f700f51280622ef1308763d4d0855342681c914af8cbf6c5bd2eb0ea32c55","source":{"kind":"arxiv","id":"1209.2684","version":1},"attestation_state":"computed","paper":{"title":"NetSimile: A Scalable Approach to Size-Independent Network Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.AP"],"primary_cat":"cs.SI","authors_text":"Christos Faloutsos, Danai Koutra, Michele Berlingerio, Tina Eliassi-Rad","submitted_at":"2012-09-12T18:32:55Z","abstract_excerpt":"Given a set of k networks, possibly with different sizes and no overlaps in nodes or edges, how can we quickly assess similarity between them, without solving the node-correspondence problem? Analogously, how can we extract a small number of descriptive, numerical features from each graph that effectively serve as the graph's \"signature\"? Having such features will enable a wealth of graph mining tasks, including clustering, outlier detection, visualization, etc.\n  We propose NetSimile -- a novel, effective, and scalable method for solving the aforementioned problem. NetSimile has the following"},"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":"1209.2684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-09-12T18:32:55Z","cross_cats_sorted":["physics.soc-ph","stat.AP"],"title_canon_sha256":"fa7a3450eb1f74ea982a8577af3a3f6eec15493b13540b61f33fbc99adb4b1ed","abstract_canon_sha256":"8fb1f94bcdcca30647da8bdd58da8cea2edbf47bf5460175e4bfc67f3f3b7bfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:42.384834Z","signature_b64":"vYjiHndIfNTlWyK2AmSNvdkfjGEtja8Lx8HOoCuqNkI2RPWD4y5vNfzTxJihvg900h1DckxUZoLd8CKJdf9IBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"797f700f51280622ef1308763d4d0855342681c914af8cbf6c5bd2eb0ea32c55","last_reissued_at":"2026-05-18T03:45:42.384251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:42.384251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NetSimile: A Scalable Approach to Size-Independent Network Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.AP"],"primary_cat":"cs.SI","authors_text":"Christos Faloutsos, Danai Koutra, Michele Berlingerio, Tina Eliassi-Rad","submitted_at":"2012-09-12T18:32:55Z","abstract_excerpt":"Given a set of k networks, possibly with different sizes and no overlaps in nodes or edges, how can we quickly assess similarity between them, without solving the node-correspondence problem? Analogously, how can we extract a small number of descriptive, numerical features from each graph that effectively serve as the graph's \"signature\"? Having such features will enable a wealth of graph mining tasks, including clustering, outlier detection, visualization, etc.\n  We propose NetSimile -- a novel, effective, and scalable method for solving the aforementioned problem. NetSimile has the following"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2684","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.2684","created_at":"2026-05-18T03:45:42.384341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2684v1","created_at":"2026-05-18T03:45:42.384341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2684","created_at":"2026-05-18T03:45:42.384341+00:00"},{"alias_kind":"pith_short_12","alias_value":"PF7XAD2RFADC","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PF7XAD2RFADCF3YT","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PF7XAD2R","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04589","citing_title":"Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Points","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04589","citing_title":"Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Points","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12721","citing_title":"InsightFlow: LLM-Driven Synthesis of Patient Narratives for Mental Health into Causal Models","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU","json":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU.json","graph_json":"https://pith.science/api/pith-number/PF7XAD2RFADCF3YTBB3D2TIIKU/graph.json","events_json":"https://pith.science/api/pith-number/PF7XAD2RFADCF3YTBB3D2TIIKU/events.json","paper":"https://pith.science/paper/PF7XAD2R"},"agent_actions":{"view_html":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU","download_json":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU.json","view_paper":"https://pith.science/paper/PF7XAD2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2684&json=true","fetch_graph":"https://pith.science/api/pith-number/PF7XAD2RFADCF3YTBB3D2TIIKU/graph.json","fetch_events":"https://pith.science/api/pith-number/PF7XAD2RFADCF3YTBB3D2TIIKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU/action/storage_attestation","attest_author":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU/action/author_attestation","sign_citation":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU/action/citation_signature","submit_replication":"https://pith.science/pith/PF7XAD2RFADCF3YTBB3D2TIIKU/action/replication_record"}},"created_at":"2026-05-18T03:45:42.384341+00:00","updated_at":"2026-05-18T03:45:42.384341+00:00"}