{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IHYFLA7DVEIAJBEA3LNOIJ472C","short_pith_number":"pith:IHYFLA7D","canonical_record":{"source":{"id":"2212.07297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-12-14T16:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"d66535653e43cde517db88aeba2e6a28e47c95e287b498a36cf8b578a6da9f0d","abstract_canon_sha256":"7f9a328328f1b8c73c5ed59831c69a3760203729007c30c7a4ab946d3a7ade4e"},"schema_version":"1.0"},"canonical_sha256":"41f05583e3a910048480dadae4279fd0a3ba40acc4c2a1c8ea10c0ead4e4f37d","source":{"kind":"arxiv","id":"2212.07297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.07297","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"arxiv_version","alias_value":"2212.07297v1","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.07297","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"pith_short_12","alias_value":"IHYFLA7DVEIA","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"pith_short_16","alias_value":"IHYFLA7DVEIAJBEA","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"pith_short_8","alias_value":"IHYFLA7D","created_at":"2026-07-05T05:25:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IHYFLA7DVEIAJBEA3LNOIJ472C","target":"record","payload":{"canonical_record":{"source":{"id":"2212.07297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-12-14T16:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"d66535653e43cde517db88aeba2e6a28e47c95e287b498a36cf8b578a6da9f0d","abstract_canon_sha256":"7f9a328328f1b8c73c5ed59831c69a3760203729007c30c7a4ab946d3a7ade4e"},"schema_version":"1.0"},"canonical_sha256":"41f05583e3a910048480dadae4279fd0a3ba40acc4c2a1c8ea10c0ead4e4f37d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:25:23.516913Z","signature_b64":"MXCsfeCvdWddM352dhZ4fpd903O94glE3r2kHygamYVFQ1l47qayusJbL60jh/f+aJSPqKOT43XNcFVmjiOrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f05583e3a910048480dadae4279fd0a3ba40acc4c2a1c8ea10c0ead4e4f37d","last_reissued_at":"2026-07-05T05:25:23.516495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:25:23.516495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.07297","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-07-05T05:25:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oR30+K8bxoeFfQTI+IbP2mgO5XOsFnWdRT3+0v3U3v9RHTzr6Dz0KPm3w9oG0b6hAsXPGeaoOCHqwRzxdKtUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:47:20.395502Z"},"content_sha256":"ed70a332a5e1b29e3776c6fadb9b01742f94ce4f8425b56825a1628bd33ad199","schema_version":"1.0","event_id":"sha256:ed70a332a5e1b29e3776c6fadb9b01742f94ce4f8425b56825a1628bd33ad199"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IHYFLA7DVEIAJBEA3LNOIJ472C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LGRASS: Linear Graph Spectral Sparsification for Final Task of the 3rd ACM-China International Parallel Computing Challenge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chenhan Bai, Jiyan Qiu, Yuxuan Chen, Zidong Han","submitted_at":"2022-12-14T16:00:09Z","abstract_excerpt":"This paper presents our solution for optimization task of the 3rd ACM-China IPCC. By the complexity analysis, we identified three time-consuming subroutines of original algorithm: marking edges, computing pseudo inverse and sorting edges. These subroutines becomes the main performance bottleneck owing to their super-linear time complexity. To address this, we proposed LGRASS, a linear graph spectral sparsification algorithm to run in strictly linear time. LGRASS takes advantage of spanning tree properties and efficient algorithms to optimize bottleneck subroutines. Furthermore, we crafted a pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.07297","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/2212.07297/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-07-05T05:25:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4w11FIL7loJkPghdanYwVMtPde/J7UtRHU6izdnHn+uvmfG7A2YB5+3uKL9Ylc+7/gFVZwxwpNzcA/5YEPlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:47:20.396475Z"},"content_sha256":"b105f7c99d82033da2ca0435b3ea35aa93bb600e3f9f32ea7a76775bb035eb3a","schema_version":"1.0","event_id":"sha256:b105f7c99d82033da2ca0435b3ea35aa93bb600e3f9f32ea7a76775bb035eb3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHYFLA7DVEIAJBEA3LNOIJ472C/bundle.json","state_url":"https://pith.science/pith/IHYFLA7DVEIAJBEA3LNOIJ472C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHYFLA7DVEIAJBEA3LNOIJ472C/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-08-15T08:47:20Z","links":{"resolver":"https://pith.science/pith/IHYFLA7DVEIAJBEA3LNOIJ472C","bundle":"https://pith.science/pith/IHYFLA7DVEIAJBEA3LNOIJ472C/bundle.json","state":"https://pith.science/pith/IHYFLA7DVEIAJBEA3LNOIJ472C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHYFLA7DVEIAJBEA3LNOIJ472C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IHYFLA7DVEIAJBEA3LNOIJ472C","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":"7f9a328328f1b8c73c5ed59831c69a3760203729007c30c7a4ab946d3a7ade4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-12-14T16:00:09Z","title_canon_sha256":"d66535653e43cde517db88aeba2e6a28e47c95e287b498a36cf8b578a6da9f0d"},"schema_version":"1.0","source":{"id":"2212.07297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.07297","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"arxiv_version","alias_value":"2212.07297v1","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.07297","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"pith_short_12","alias_value":"IHYFLA7DVEIA","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"pith_short_16","alias_value":"IHYFLA7DVEIAJBEA","created_at":"2026-07-05T05:25:23Z"},{"alias_kind":"pith_short_8","alias_value":"IHYFLA7D","created_at":"2026-07-05T05:25:23Z"}],"graph_snapshots":[{"event_id":"sha256:b105f7c99d82033da2ca0435b3ea35aa93bb600e3f9f32ea7a76775bb035eb3a","target":"graph","created_at":"2026-07-05T05:25:23Z","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/2212.07297/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents our solution for optimization task of the 3rd ACM-China IPCC. By the complexity analysis, we identified three time-consuming subroutines of original algorithm: marking edges, computing pseudo inverse and sorting edges. These subroutines becomes the main performance bottleneck owing to their super-linear time complexity. To address this, we proposed LGRASS, a linear graph spectral sparsification algorithm to run in strictly linear time. LGRASS takes advantage of spanning tree properties and efficient algorithms to optimize bottleneck subroutines. Furthermore, we crafted a pa","authors_text":"Chenhan Bai, Jiyan Qiu, Yuxuan Chen, Zidong Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-12-14T16:00:09Z","title":"LGRASS: Linear Graph Spectral Sparsification for Final Task of the 3rd ACM-China International Parallel Computing Challenge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.07297","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:ed70a332a5e1b29e3776c6fadb9b01742f94ce4f8425b56825a1628bd33ad199","target":"record","created_at":"2026-07-05T05:25:23Z","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":"7f9a328328f1b8c73c5ed59831c69a3760203729007c30c7a4ab946d3a7ade4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-12-14T16:00:09Z","title_canon_sha256":"d66535653e43cde517db88aeba2e6a28e47c95e287b498a36cf8b578a6da9f0d"},"schema_version":"1.0","source":{"id":"2212.07297","kind":"arxiv","version":1}},"canonical_sha256":"41f05583e3a910048480dadae4279fd0a3ba40acc4c2a1c8ea10c0ead4e4f37d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41f05583e3a910048480dadae4279fd0a3ba40acc4c2a1c8ea10c0ead4e4f37d","first_computed_at":"2026-07-05T05:25:23.516495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:25:23.516495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MXCsfeCvdWddM352dhZ4fpd903O94glE3r2kHygamYVFQ1l47qayusJbL60jh/f+aJSPqKOT43XNcFVmjiOrBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:25:23.516913Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.07297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed70a332a5e1b29e3776c6fadb9b01742f94ce4f8425b56825a1628bd33ad199","sha256:b105f7c99d82033da2ca0435b3ea35aa93bb600e3f9f32ea7a76775bb035eb3a"],"state_sha256":"515d9e6f35bfa19287839fe04022a3b0f5cf073389e6e74950478bfb6b21d020"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZpMWM36WWXqGwnZ8cDqena8103oKuvXKw7i5osGgXfh6ibb5Vqq09Z17BKvIMP4BqdMFIT1P8oH5ue9pKlvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T08:47:20.402107Z","bundle_sha256":"baf0b1e2ac0e5b9cc2b158d10afb03c0826d036af9ed0633aa67ec563053f720"}}