{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3HA23MQLEXBZETKWGFFGQOVQK5","short_pith_number":"pith:3HA23MQL","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"},"canonical_sha256":"d9c1adb20b25c3924d56314a683ab0576ab0010f5f7250439083352ca7563519","source":{"kind":"arxiv","id":"1801.04301","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04301","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04301v1","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04301","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"3HA23MQLEXBZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3HA23MQLEXBZETKW","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3HA23MQL","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3HA23MQLEXBZETKWGFFGQOVQK5","target":"record","payload":{"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"},"canonical_sha256":"d9c1adb20b25c3924d56314a683ab0576ab0010f5f7250439083352ca7563519","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"},"source_kind":"arxiv","source_id":"1801.04301","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-18T00:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDZgR9b00AaKFIawKrZM4xNbWYS+0SDseR3Qeix4pRUGdsg1vokQthpuZNodlM/tQE8xKnJdFTiIgGWSCdndBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:36:02.968991Z"},"content_sha256":"0baafe4c79b432c453533ba08fbb4354f8fcda7cc1a36809db210507c93e2b33","schema_version":"1.0","event_id":"sha256:0baafe4c79b432c453533ba08fbb4354f8fcda7cc1a36809db210507c93e2b33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3HA23MQLEXBZETKWGFFGQOVQK5","target":"graph","payload":{"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"},"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-18T00:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xuFDva37REyMeQ+A0o+NS3WDsyd1zxoAczSNCJH89F9sT3o111TH9bWQ6klTEzGtx/N1Rwle5rxFwKgf98tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:36:02.969733Z"},"content_sha256":"1acedc453fdacd1d41ff69f785af39cacc9fa1c7096289c178bbecd1e8d8def6","schema_version":"1.0","event_id":"sha256:1acedc453fdacd1d41ff69f785af39cacc9fa1c7096289c178bbecd1e8d8def6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/bundle.json","state_url":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HA23MQLEXBZETKWGFFGQOVQK5/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-28T13:36:02Z","links":{"resolver":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5","bundle":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/bundle.json","state":"https://pith.science/pith/3HA23MQLEXBZETKWGFFGQOVQK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HA23MQLEXBZETKWGFFGQOVQK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3HA23MQLEXBZETKWGFFGQOVQK5","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":"7dfc6616170d9d9579d35485bae8436f9e28dc228d68d8998edd5d472a6bdfe9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T20:06:06Z","title_canon_sha256":"2a4e5cf06691733cb63b950307412232c306b63ffb3b7aacc593fdffa7d98106"},"schema_version":"1.0","source":{"id":"1801.04301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04301","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04301v1","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04301","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"3HA23MQLEXBZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3HA23MQLEXBZETKW","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3HA23MQL","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:1acedc453fdacd1d41ff69f785af39cacc9fa1c7096289c178bbecd1e8d8def6","target":"graph","created_at":"2026-05-18T00:26:06Z","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":"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","authors_text":"Jose Bento, Stratis Ioannidis","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T20:06:06Z","title":"A Family of Tractable Graph Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04301","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:0baafe4c79b432c453533ba08fbb4354f8fcda7cc1a36809db210507c93e2b33","target":"record","created_at":"2026-05-18T00:26:06Z","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":"7dfc6616170d9d9579d35485bae8436f9e28dc228d68d8998edd5d472a6bdfe9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T20:06:06Z","title_canon_sha256":"2a4e5cf06691733cb63b950307412232c306b63ffb3b7aacc593fdffa7d98106"},"schema_version":"1.0","source":{"id":"1801.04301","kind":"arxiv","version":1}},"canonical_sha256":"d9c1adb20b25c3924d56314a683ab0576ab0010f5f7250439083352ca7563519","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9c1adb20b25c3924d56314a683ab0576ab0010f5f7250439083352ca7563519","first_computed_at":"2026-05-18T00:26:06.934194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:06.934194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f3Sw7CU7vGJNXQQdjNAqC/rEDwoPszWfEI2ZpXvl/axsoK8bVAGdCUnKHvZtIe1x2LGTm54H5cdOHC3pdgxuDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:06.934916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0baafe4c79b432c453533ba08fbb4354f8fcda7cc1a36809db210507c93e2b33","sha256:1acedc453fdacd1d41ff69f785af39cacc9fa1c7096289c178bbecd1e8d8def6"],"state_sha256":"08cfea587ef6dc6fc192f1a14f75f1701d3ba13c7fab379ce056ffcb3d99ddc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVQ/E6B0zv2uL/UsK4si3HIHoZTWEcjaS2Dmj4KXsEtn/r/VNWindoF86pOOOTGbYWqmz+F34nwBX5W0wSLzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:36:02.973435Z","bundle_sha256":"4f75c7209c9b0ac3d7f783d2e276d872a196d85199b0c86e216596fe8f21bfc1"}}