{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FBVGLM3KWYGOQCHEV5G7FRT2GJ","short_pith_number":"pith:FBVGLM3K","canonical_record":{"source":{"id":"2503.11910","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T22:42:13Z","cross_cats_sorted":["cs.AI","math.AT","math.SG"],"title_canon_sha256":"d03a61d77b74e5de2746956c2d52a0cda05d0c53c63c680d4f8a16215de0f148","abstract_canon_sha256":"94209726c74912e50059f0568740e6f2b0813c8abf6d442e192838cae8f8c16c"},"schema_version":"1.0"},"canonical_sha256":"286a65b36ab60ce808e4af4df2c67a327ebbec0ab0baffc8926f1c85a876d504","source":{"kind":"arxiv","id":"2503.11910","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.11910","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"arxiv_version","alias_value":"2503.11910v1","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11910","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"pith_short_12","alias_value":"FBVGLM3KWYGO","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"pith_short_16","alias_value":"FBVGLM3KWYGOQCHE","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"pith_short_8","alias_value":"FBVGLM3K","created_at":"2026-06-05T01:14:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FBVGLM3KWYGOQCHEV5G7FRT2GJ","target":"record","payload":{"canonical_record":{"source":{"id":"2503.11910","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T22:42:13Z","cross_cats_sorted":["cs.AI","math.AT","math.SG"],"title_canon_sha256":"d03a61d77b74e5de2746956c2d52a0cda05d0c53c63c680d4f8a16215de0f148","abstract_canon_sha256":"94209726c74912e50059f0568740e6f2b0813c8abf6d442e192838cae8f8c16c"},"schema_version":"1.0"},"canonical_sha256":"286a65b36ab60ce808e4af4df2c67a327ebbec0ab0baffc8926f1c85a876d504","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:25.618938Z","signature_b64":"kDsl6UiCt9R6id3fFSk6Mvl+sQfckYbXGh1s8+dvqF3JpA9J6SCGe+poCDKZ0yjAgV9DuF+X53PrE6G/vFenCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"286a65b36ab60ce808e4af4df2c67a327ebbec0ab0baffc8926f1c85a876d504","last_reissued_at":"2026-06-05T01:14:25.618291Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:25.618291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.11910","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-06-05T01:14:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VrCz3xJ5FPMkuEKGj9hvI8/DciOzbHHLc2s84ZwBqCxpSDklRCBsIiDX1Ak9eaha0TvS4CYVXcT6MURLVZeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:37:26.225094Z"},"content_sha256":"135083c70b7f97bcbc719f50083cd46ce2bb852da0e9a1bec4f864035feb0616","schema_version":"1.0","event_id":"sha256:135083c70b7f97bcbc719f50083cd46ce2bb852da0e9a1bec4f864035feb0616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FBVGLM3KWYGOQCHEV5G7FRT2GJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RTD-Lite: Scalable Topological Analysis for Comparing Weighted Graphs in Learning Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.AT","math.SG"],"primary_cat":"cs.LG","authors_text":"Daria Voronkova, Eduard Tulchinskii, Evgeny Burnaev, Ilya Trofimov, Serguei Barannikov","submitted_at":"2025-03-14T22:42:13Z","abstract_excerpt":"Topological methods for comparing weighted graphs are valuable in various learning tasks but often suffer from computational inefficiency on large datasets. We introduce RTD-Lite, a scalable algorithm that efficiently compares topological features, specifically connectivity or cluster structures at arbitrary scales, of two weighted graphs with one-to-one correspondence between vertices. Using minimal spanning trees in auxiliary graphs, RTD-Lite captures topological discrepancies with $O(n^2)$ time and memory complexity. This efficiency enables its application in tasks like dimensionality reduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11910","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.11910/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-05T01:14:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2589YAafjRF7nnVgbRpTt7lMnXMIf/LgaqBRpP4DItGh8YQa61sG0GIJ6092hX3vfl83DM5Jw1S1wKUgYm8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:37:26.226213Z"},"content_sha256":"ae8463e0ddfdf5122d4e9ab7fb525f0f29aaff83df35eb92f69739d0b9ac61be","schema_version":"1.0","event_id":"sha256:ae8463e0ddfdf5122d4e9ab7fb525f0f29aaff83df35eb92f69739d0b9ac61be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBVGLM3KWYGOQCHEV5G7FRT2GJ/bundle.json","state_url":"https://pith.science/pith/FBVGLM3KWYGOQCHEV5G7FRT2GJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBVGLM3KWYGOQCHEV5G7FRT2GJ/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-06-06T18:37:26Z","links":{"resolver":"https://pith.science/pith/FBVGLM3KWYGOQCHEV5G7FRT2GJ","bundle":"https://pith.science/pith/FBVGLM3KWYGOQCHEV5G7FRT2GJ/bundle.json","state":"https://pith.science/pith/FBVGLM3KWYGOQCHEV5G7FRT2GJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBVGLM3KWYGOQCHEV5G7FRT2GJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FBVGLM3KWYGOQCHEV5G7FRT2GJ","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":"94209726c74912e50059f0568740e6f2b0813c8abf6d442e192838cae8f8c16c","cross_cats_sorted":["cs.AI","math.AT","math.SG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T22:42:13Z","title_canon_sha256":"d03a61d77b74e5de2746956c2d52a0cda05d0c53c63c680d4f8a16215de0f148"},"schema_version":"1.0","source":{"id":"2503.11910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.11910","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"arxiv_version","alias_value":"2503.11910v1","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11910","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"pith_short_12","alias_value":"FBVGLM3KWYGO","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"pith_short_16","alias_value":"FBVGLM3KWYGOQCHE","created_at":"2026-06-05T01:14:25Z"},{"alias_kind":"pith_short_8","alias_value":"FBVGLM3K","created_at":"2026-06-05T01:14:25Z"}],"graph_snapshots":[{"event_id":"sha256:ae8463e0ddfdf5122d4e9ab7fb525f0f29aaff83df35eb92f69739d0b9ac61be","target":"graph","created_at":"2026-06-05T01:14:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.11910/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Topological methods for comparing weighted graphs are valuable in various learning tasks but often suffer from computational inefficiency on large datasets. We introduce RTD-Lite, a scalable algorithm that efficiently compares topological features, specifically connectivity or cluster structures at arbitrary scales, of two weighted graphs with one-to-one correspondence between vertices. Using minimal spanning trees in auxiliary graphs, RTD-Lite captures topological discrepancies with $O(n^2)$ time and memory complexity. This efficiency enables its application in tasks like dimensionality reduc","authors_text":"Daria Voronkova, Eduard Tulchinskii, Evgeny Burnaev, Ilya Trofimov, Serguei Barannikov","cross_cats":["cs.AI","math.AT","math.SG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T22:42:13Z","title":"RTD-Lite: Scalable Topological Analysis for Comparing Weighted Graphs in Learning Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11910","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:135083c70b7f97bcbc719f50083cd46ce2bb852da0e9a1bec4f864035feb0616","target":"record","created_at":"2026-06-05T01:14:25Z","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":"94209726c74912e50059f0568740e6f2b0813c8abf6d442e192838cae8f8c16c","cross_cats_sorted":["cs.AI","math.AT","math.SG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T22:42:13Z","title_canon_sha256":"d03a61d77b74e5de2746956c2d52a0cda05d0c53c63c680d4f8a16215de0f148"},"schema_version":"1.0","source":{"id":"2503.11910","kind":"arxiv","version":1}},"canonical_sha256":"286a65b36ab60ce808e4af4df2c67a327ebbec0ab0baffc8926f1c85a876d504","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"286a65b36ab60ce808e4af4df2c67a327ebbec0ab0baffc8926f1c85a876d504","first_computed_at":"2026-06-05T01:14:25.618291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:14:25.618291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kDsl6UiCt9R6id3fFSk6Mvl+sQfckYbXGh1s8+dvqF3JpA9J6SCGe+poCDKZ0yjAgV9DuF+X53PrE6G/vFenCg==","signature_status":"signed_v1","signed_at":"2026-06-05T01:14:25.618938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.11910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:135083c70b7f97bcbc719f50083cd46ce2bb852da0e9a1bec4f864035feb0616","sha256:ae8463e0ddfdf5122d4e9ab7fb525f0f29aaff83df35eb92f69739d0b9ac61be"],"state_sha256":"59b34679e82056925563009b18fbd084f114ab319f8f10bad6e8d2e71b7728db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZekXUmZ3SA5us1L75KIL6QgbNci2szyJsCkZN5aA/Ihm9UrD71MsZRKXFuMF2UR0eVtqxULEXPUjlqhCsg6wDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:37:26.229984Z","bundle_sha256":"f4e06966bf5d9974bcb6fb9249f86782d70ef6f99576ec1c30f7cd4d5f885d46"}}