{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3HA23MQLEXBZETKWGFFGQOVQK5","short_pith_number":"pith:3HA23MQL","schema_version":"1.0","canonical_sha256":"d9c1adb20b25c3924d56314a683ab0576ab0010f5f7250439083352ca7563519","source":{"kind":"arxiv","id":"1801.04301","version":1},"attestation_state":"computed","paper":{"title":"A Family of Tractable Graph Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jose Bento, Stratis Ioannidis","submitted_at":"2018-01-12T20:06:06Z","abstract_excerpt":"Important data mining problems such as nearest-neighbor search and clustering admit theoretical guarantees when restricted to objects embedded in a metric space. Graphs are ubiquitous, and clustering and classification over graphs arise in diverse areas, including, e.g., image processing and social networks. Unfortunately, popular distance scores used in these applications, that scale over large graphs, are not metrics and thus come with no guarantees. Classic graph distances such as, e.g., the chemical and the CKS distance are arguably natural and intuitive, and are indeed also metrics, but t"},"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.04301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T20:06:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2a4e5cf06691733cb63b950307412232c306b63ffb3b7aacc593fdffa7d98106","abstract_canon_sha256":"7dfc6616170d9d9579d35485bae8436f9e28dc228d68d8998edd5d472a6bdfe9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:06.934916Z","signature_b64":"f3Sw7CU7vGJNXQQdjNAqC/rEDwoPszWfEI2ZpXvl/axsoK8bVAGdCUnKHvZtIe1x2LGTm54H5cdOHC3pdgxuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9c1adb20b25c3924d56314a683ab0576ab0010f5f7250439083352ca7563519","last_reissued_at":"2026-05-18T00:26:06.934194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:06.934194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Family of Tractable Graph Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jose Bento, Stratis Ioannidis","submitted_at":"2018-01-12T20:06:06Z","abstract_excerpt":"Important data mining problems such as nearest-neighbor search and clustering admit theoretical guarantees when restricted to objects embedded in a metric space. Graphs are ubiquitous, and clustering and classification over graphs arise in diverse areas, including, e.g., image processing and social networks. Unfortunately, popular distance scores used in these applications, that scale over large graphs, are not metrics and thus come with no guarantees. Classic graph distances such as, e.g., the chemical and the CKS distance are arguably natural and intuitive, and are indeed also metrics, but t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04301","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":"1801.04301","created_at":"2026-05-18T00:26:06.934303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04301v1","created_at":"2026-05-18T00:26:06.934303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04301","created_at":"2026-05-18T00:26:06.934303+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HA23MQLEXBZ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HA23MQLEXBZETKW","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HA23MQL","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5","json":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5.json","graph_json":"https://pith.science/api/pith-number/3HA23MQLEXBZETKWGFFGQOVQK5/graph.json","events_json":"https://pith.science/api/pith-number/3HA23MQLEXBZETKWGFFGQOVQK5/events.json","paper":"https://pith.science/paper/3HA23MQL"},"agent_actions":{"view_html":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5","download_json":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5.json","view_paper":"https://pith.science/paper/3HA23MQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04301&json=true","fetch_graph":"https://pith.science/api/pith-number/3HA23MQLEXBZETKWGFFGQOVQK5/graph.json","fetch_events":"https://pith.science/api/pith-number/3HA23MQLEXBZETKWGFFGQOVQK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/action/storage_attestation","attest_author":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/action/author_attestation","sign_citation":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/action/citation_signature","submit_replication":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/action/replication_record"}},"created_at":"2026-05-18T00:26:06.934303+00:00","updated_at":"2026-05-18T00:26:06.934303+00:00"}