{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EN2CPRAGFLSDU4RE4GTT2RXIQJ","short_pith_number":"pith:EN2CPRAG","schema_version":"1.0","canonical_sha256":"237427c4062ae43a7224e1a73d46e88258f945b994dab87c695f654a5afa7aeb","source":{"kind":"arxiv","id":"1110.0517","version":1},"attestation_state":"computed","paper":{"title":"Distance Preserving Graph Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ning Ruan, Ruoming Jin, Yan Huang","submitted_at":"2011-10-03T21:35:58Z","abstract_excerpt":"Large graphs are difficult to represent, visualize, and understand. In this paper, we introduce \"gate graph\" - a new approach to perform graph simplification. A gate graph provides a simplified topological view of the original graph. Specifically, we construct a gate graph from a large graph so that for any \"non-local\" vertex pair (distance higher than some threshold) in the original graph, their shortest-path distance can be recovered by consecutive \"local\" walks through the gate vertices in the gate graph. We perform a theoretical investigation on the gate-vertex set discovery problem. We ch"},"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":"1110.0517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-10-03T21:35:58Z","cross_cats_sorted":[],"title_canon_sha256":"b2d46e33b806e8c8d6802101f6b57ab1e6c470f34aeafb23294be288553e7389","abstract_canon_sha256":"5e0b4238455141a9f0f3bf8e20c72f3e1cb09047c9007e24790f8bff7d2ec6ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.204938Z","signature_b64":"iljl6Qi4OUQTsaq+4QBCdu/ubKFMBB2QjOwSv9kfjBxv8Zcph/W9kxmdGWkWY6HIlHkZpMrHystWsq3Yv73WDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"237427c4062ae43a7224e1a73d46e88258f945b994dab87c695f654a5afa7aeb","last_reissued_at":"2026-05-18T00:57:57.204396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.204396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance Preserving Graph Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ning Ruan, Ruoming Jin, Yan Huang","submitted_at":"2011-10-03T21:35:58Z","abstract_excerpt":"Large graphs are difficult to represent, visualize, and understand. In this paper, we introduce \"gate graph\" - a new approach to perform graph simplification. A gate graph provides a simplified topological view of the original graph. Specifically, we construct a gate graph from a large graph so that for any \"non-local\" vertex pair (distance higher than some threshold) in the original graph, their shortest-path distance can be recovered by consecutive \"local\" walks through the gate vertices in the gate graph. We perform a theoretical investigation on the gate-vertex set discovery problem. We ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0517","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":"1110.0517","created_at":"2026-05-18T00:57:57.204505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0517v1","created_at":"2026-05-18T00:57:57.204505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0517","created_at":"2026-05-18T00:57:57.204505+00:00"},{"alias_kind":"pith_short_12","alias_value":"EN2CPRAGFLSD","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EN2CPRAGFLSDU4RE","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EN2CPRAG","created_at":"2026-05-18T12:26:28.662955+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/EN2CPRAGFLSDU4RE4GTT2RXIQJ","json":"https://pith.science/pith/EN2CPRAGFLSDU4RE4GTT2RXIQJ.json","graph_json":"https://pith.science/api/pith-number/EN2CPRAGFLSDU4RE4GTT2RXIQJ/graph.json","events_json":"https://pith.science/api/pith-number/EN2CPRAGFLSDU4RE4GTT2RXIQJ/events.json","paper":"https://pith.science/paper/EN2CPRAG"},"agent_actions":{"view_html":"https://pith.science/pith/EN2CPRAGFLSDU4RE4GTT2RXIQJ","download_json":"https://pith.science/pith/EN2CPRAGFLSDU4RE4GTT2RXIQJ.json","view_paper":"https://pith.science/paper/EN2CPRAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0517&json=true","fetch_graph":"https://pith.science/api/pith-number/EN2CPRAGFLSDU4RE4GTT2RXIQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EN2CPRAGFLSDU4RE4GTT2RXIQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EN2CPRAGFLSDU4RE4GTT2RXIQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EN2CPRAGFLSDU4RE4GTT2RXIQJ/action/storage_attestation","attest_author":"https://pith.science/pith/EN2CPRAGFLSDU4RE4GTT2RXIQJ/action/author_attestation","sign_citation":"https://pith.science/pith/EN2CPRAGFLSDU4RE4GTT2RXIQJ/action/citation_signature","submit_replication":"https://pith.science/pith/EN2CPRAGFLSDU4RE4GTT2RXIQJ/action/replication_record"}},"created_at":"2026-05-18T00:57:57.204505+00:00","updated_at":"2026-05-18T00:57:57.204505+00:00"}