{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CT5RMMFD7VKKD7WZ3LKH4APUOU","short_pith_number":"pith:CT5RMMFD","canonical_record":{"source":{"id":"2606.26599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-06-25T04:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"f366c267ce27b19053327b9482e23cbb23755aa16288ce8908a777591bba2097","abstract_canon_sha256":"906b178006c9b492333a0388038998ddab7d165fdf7cc56960f30615d1ec7cc7"},"schema_version":"1.0"},"canonical_sha256":"14fb1630a3fd54a1fed9dad47e01f4750e7314bcb6eea6da75d3e8d75a659375","source":{"kind":"arxiv","id":"2606.26599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26599","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26599v1","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26599","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"CT5RMMFD7VKK","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"pith_short_16","alias_value":"CT5RMMFD7VKKD7WZ","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"pith_short_8","alias_value":"CT5RMMFD","created_at":"2026-06-26T01:15:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CT5RMMFD7VKKD7WZ3LKH4APUOU","target":"record","payload":{"canonical_record":{"source":{"id":"2606.26599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-06-25T04:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"f366c267ce27b19053327b9482e23cbb23755aa16288ce8908a777591bba2097","abstract_canon_sha256":"906b178006c9b492333a0388038998ddab7d165fdf7cc56960f30615d1ec7cc7"},"schema_version":"1.0"},"canonical_sha256":"14fb1630a3fd54a1fed9dad47e01f4750e7314bcb6eea6da75d3e8d75a659375","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:35.904773Z","signature_b64":"cHPMArOc7mJ38ot5Qc1urCqXdQnLaCKEtJUpoJmHgO2x02tSvaMhqe+1g0ONxxMhn0u6jvXEwBZaun/I09P0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14fb1630a3fd54a1fed9dad47e01f4750e7314bcb6eea6da75d3e8d75a659375","last_reissued_at":"2026-06-26T01:15:35.904356Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:35.904356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.26599","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-26T01:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLAxpJtmBlcjfRBQysBjRl+/chrsvQ6suusneinCa3QPe+sX9+MfoSzpoWaj97xHNVjNzX4F2RfL6E88m0r+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:40:15.082467Z"},"content_sha256":"7ce04fb038036015dd7f82eac9df11fadd807dbfdad0fb357417d978705ad113","schema_version":"1.0","event_id":"sha256:7ce04fb038036015dd7f82eac9df11fadd807dbfdad0fb357417d978705ad113"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CT5RMMFD7VKKD7WZ3LKH4APUOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Computation for Diagonal of Forest Matrix via Variance-Reduced Forest Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Haoxin Sun, Zhongzhi Zhang","submitted_at":"2026-06-25T04:58:55Z","abstract_excerpt":"The forest matrix of a graph, particularly its diagonal elements, has far-reaching implications in network science and machine learning. The state-of-the-art algorithms for the diagonal of forest matrix computation are based on the fast Laplacian solver. However, these algorithms encounter limitations when applied to digraphs due to the incapacity of the Laplacian solver. To overcome the issue, in this paper, we propose three novel sampling-based algorithms: SCF, SCFV, and SCFV+. Our first algorithm SCF leverages a probability interpretation of the diagonal of the forest matrix and utilizes an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26599","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/2606.26599/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-26T01:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92QL2CjuCAN9E421VsP9K1gnG8d7D3u4yei/I+4suzJZO73pm8ZlYzmvXAqNrEm23JdMbNJI9oQpx6ZS/C2RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:40:15.083065Z"},"content_sha256":"b0d274424884837d1e75709d4f54a67c9e63f5c60a741bbc5c6d7cb4c6250c23","schema_version":"1.0","event_id":"sha256:b0d274424884837d1e75709d4f54a67c9e63f5c60a741bbc5c6d7cb4c6250c23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CT5RMMFD7VKKD7WZ3LKH4APUOU/bundle.json","state_url":"https://pith.science/pith/CT5RMMFD7VKKD7WZ3LKH4APUOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CT5RMMFD7VKKD7WZ3LKH4APUOU/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-07-01T23:40:15Z","links":{"resolver":"https://pith.science/pith/CT5RMMFD7VKKD7WZ3LKH4APUOU","bundle":"https://pith.science/pith/CT5RMMFD7VKKD7WZ3LKH4APUOU/bundle.json","state":"https://pith.science/pith/CT5RMMFD7VKKD7WZ3LKH4APUOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CT5RMMFD7VKKD7WZ3LKH4APUOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CT5RMMFD7VKKD7WZ3LKH4APUOU","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":"906b178006c9b492333a0388038998ddab7d165fdf7cc56960f30615d1ec7cc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-06-25T04:58:55Z","title_canon_sha256":"f366c267ce27b19053327b9482e23cbb23755aa16288ce8908a777591bba2097"},"schema_version":"1.0","source":{"id":"2606.26599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26599","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26599v1","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26599","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"CT5RMMFD7VKK","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"pith_short_16","alias_value":"CT5RMMFD7VKKD7WZ","created_at":"2026-06-26T01:15:35Z"},{"alias_kind":"pith_short_8","alias_value":"CT5RMMFD","created_at":"2026-06-26T01:15:35Z"}],"graph_snapshots":[{"event_id":"sha256:b0d274424884837d1e75709d4f54a67c9e63f5c60a741bbc5c6d7cb4c6250c23","target":"graph","created_at":"2026-06-26T01:15:35Z","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/2606.26599/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The forest matrix of a graph, particularly its diagonal elements, has far-reaching implications in network science and machine learning. The state-of-the-art algorithms for the diagonal of forest matrix computation are based on the fast Laplacian solver. However, these algorithms encounter limitations when applied to digraphs due to the incapacity of the Laplacian solver. To overcome the issue, in this paper, we propose three novel sampling-based algorithms: SCF, SCFV, and SCFV+. Our first algorithm SCF leverages a probability interpretation of the diagonal of the forest matrix and utilizes an","authors_text":"Haoxin Sun, Zhongzhi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-06-25T04:58:55Z","title":"Efficient Computation for Diagonal of Forest Matrix via Variance-Reduced Forest Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26599","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:7ce04fb038036015dd7f82eac9df11fadd807dbfdad0fb357417d978705ad113","target":"record","created_at":"2026-06-26T01:15:35Z","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":"906b178006c9b492333a0388038998ddab7d165fdf7cc56960f30615d1ec7cc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-06-25T04:58:55Z","title_canon_sha256":"f366c267ce27b19053327b9482e23cbb23755aa16288ce8908a777591bba2097"},"schema_version":"1.0","source":{"id":"2606.26599","kind":"arxiv","version":1}},"canonical_sha256":"14fb1630a3fd54a1fed9dad47e01f4750e7314bcb6eea6da75d3e8d75a659375","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14fb1630a3fd54a1fed9dad47e01f4750e7314bcb6eea6da75d3e8d75a659375","first_computed_at":"2026-06-26T01:15:35.904356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:15:35.904356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cHPMArOc7mJ38ot5Qc1urCqXdQnLaCKEtJUpoJmHgO2x02tSvaMhqe+1g0ONxxMhn0u6jvXEwBZaun/I09P0Bg==","signature_status":"signed_v1","signed_at":"2026-06-26T01:15:35.904773Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.26599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ce04fb038036015dd7f82eac9df11fadd807dbfdad0fb357417d978705ad113","sha256:b0d274424884837d1e75709d4f54a67c9e63f5c60a741bbc5c6d7cb4c6250c23"],"state_sha256":"956e6b41d51fc46bd22660123038c5c895874f1363dcb5b1f7bf71c94ecd4659"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBzw4DIwZYXRNchnMw1eWwYgiCsWMSz/jc21dnk7AUzFV7599O/kf+gpIeelScsZH9Rpw9UpAECQYm86kFcDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:40:15.085273Z","bundle_sha256":"35c7aa9558a93da32144dc1468545a044099c3f7b1c0e9fed53f106858b7b3db"}}