{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YMK4SAUKT522ON4YQANC7WOWAD","short_pith_number":"pith:YMK4SAUK","schema_version":"1.0","canonical_sha256":"c315c9028a9f75a73798801a2fd9d600f3cf5f428398f8f99b08d60ba0c997b4","source":{"kind":"arxiv","id":"2606.26608","version":1},"attestation_state":"computed","paper":{"title":"Fast Estimation for Forest Matrix of Signed Graphs","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-25T05:11:21Z","abstract_excerpt":"The forest matrix of a signed graph plays an important role in network science and social opinion dynamics, yet existing algorithms are mainly designed for unsigned graphs and are difficult to extend to signed graphs. In this paper, we study the problem of efficiently estimating the forest matrix of signed graphs with n nodes and introduce the signed forest matrix theorem, which establishes the relationship between generalized spanning converging forests and the forest matrix. Based on this result, we propose a novel algorithm GSCF, built on a variant of loop-erased random walks, to generate g"},"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":"2606.26608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-06-25T05:11:21Z","cross_cats_sorted":[],"title_canon_sha256":"1b4a49aa7df9127213b94d91e886106d65aa508d87884b48f84252632b7e3e8f","abstract_canon_sha256":"ad24de80bb711a32fdf82905fa0e7abf38381a869eb5ab60a40ca5da4e484a98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:36.104154Z","signature_b64":"/aBBuRtZIN3R/PAMQzWaWLe56pp0Yu2980HQ2HAUwfX3zTSmNyzBaST22VGmVjo7aJNMHJTRhbbu6BF4zYQnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c315c9028a9f75a73798801a2fd9d600f3cf5f428398f8f99b08d60ba0c997b4","last_reissued_at":"2026-06-26T01:15:36.103725Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:36.103725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Estimation for Forest Matrix of Signed Graphs","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-25T05:11:21Z","abstract_excerpt":"The forest matrix of a signed graph plays an important role in network science and social opinion dynamics, yet existing algorithms are mainly designed for unsigned graphs and are difficult to extend to signed graphs. In this paper, we study the problem of efficiently estimating the forest matrix of signed graphs with n nodes and introduce the signed forest matrix theorem, which establishes the relationship between generalized spanning converging forests and the forest matrix. Based on this result, we propose a novel algorithm GSCF, built on a variant of loop-erased random walks, to generate g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26608","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.26608/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.26608","created_at":"2026-06-26T01:15:36.103799+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26608v1","created_at":"2026-06-26T01:15:36.103799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26608","created_at":"2026-06-26T01:15:36.103799+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMK4SAUKT522","created_at":"2026-06-26T01:15:36.103799+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMK4SAUKT522ON4Y","created_at":"2026-06-26T01:15:36.103799+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMK4SAUK","created_at":"2026-06-26T01:15:36.103799+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/YMK4SAUKT522ON4YQANC7WOWAD","json":"https://pith.science/pith/YMK4SAUKT522ON4YQANC7WOWAD.json","graph_json":"https://pith.science/api/pith-number/YMK4SAUKT522ON4YQANC7WOWAD/graph.json","events_json":"https://pith.science/api/pith-number/YMK4SAUKT522ON4YQANC7WOWAD/events.json","paper":"https://pith.science/paper/YMK4SAUK"},"agent_actions":{"view_html":"https://pith.science/pith/YMK4SAUKT522ON4YQANC7WOWAD","download_json":"https://pith.science/pith/YMK4SAUKT522ON4YQANC7WOWAD.json","view_paper":"https://pith.science/paper/YMK4SAUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26608&json=true","fetch_graph":"https://pith.science/api/pith-number/YMK4SAUKT522ON4YQANC7WOWAD/graph.json","fetch_events":"https://pith.science/api/pith-number/YMK4SAUKT522ON4YQANC7WOWAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMK4SAUKT522ON4YQANC7WOWAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMK4SAUKT522ON4YQANC7WOWAD/action/storage_attestation","attest_author":"https://pith.science/pith/YMK4SAUKT522ON4YQANC7WOWAD/action/author_attestation","sign_citation":"https://pith.science/pith/YMK4SAUKT522ON4YQANC7WOWAD/action/citation_signature","submit_replication":"https://pith.science/pith/YMK4SAUKT522ON4YQANC7WOWAD/action/replication_record"}},"created_at":"2026-06-26T01:15:36.103799+00:00","updated_at":"2026-06-26T01:15:36.103799+00:00"}