{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:MNLXT3OLLBUDFAXN2SGLL6CDBM","short_pith_number":"pith:MNLXT3OL","schema_version":"1.0","canonical_sha256":"635779edcb58683282edd48cb5f8430b27c14f05292b302432380e9848993750","source":{"kind":"arxiv","id":"math/0508178","version":2},"attestation_state":"computed","paper":{"title":"Forest matrices around the Laplacian matrix","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev, Rafig Agaev","submitted_at":"2005-08-10T11:15:17Z","abstract_excerpt":"We study the matrices Q_k of in-forests of a weighted digraph G and their connections with the Laplacian matrix L of G. The (i,j) entry of Q_k is the total weight of spanning converging forests (in-forests) with k arcs such that i belongs to a tree rooted at j. The forest matrices, Q_k, can be calculated recursively and expressed by polynomials in the Laplacian matrix; they provide representations for the generalized inverses, the powers, and some eigenvectors of L. The normalized in-forest matrices are row stochastic; the normalized matrix of maximum in-forests is the eigenprojection of the L"},"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":"math/0508178","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-08-10T11:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"926249601b7f97b1e7116d3e8079692603b1a9ff9063f64a60edbe01e38f6ab7","abstract_canon_sha256":"63f15e17c922018aa41a93024d63a6deeea7d6043446ed83d389d70911d1517f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:50:36.503432Z","signature_b64":"6NI/DGKjFxGPFfkai7nxeJd47SEOZW5T/EYg3kYa1/4HbdaUPopONgV13+x9GblKvsNHekOe+ccM+ya20yyJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"635779edcb58683282edd48cb5f8430b27c14f05292b302432380e9848993750","last_reissued_at":"2026-07-04T14:50:36.503037Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:50:36.503037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forest matrices around the Laplacian matrix","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev, Rafig Agaev","submitted_at":"2005-08-10T11:15:17Z","abstract_excerpt":"We study the matrices Q_k of in-forests of a weighted digraph G and their connections with the Laplacian matrix L of G. The (i,j) entry of Q_k is the total weight of spanning converging forests (in-forests) with k arcs such that i belongs to a tree rooted at j. The forest matrices, Q_k, can be calculated recursively and expressed by polynomials in the Laplacian matrix; they provide representations for the generalized inverses, the powers, and some eigenvectors of L. The normalized in-forest matrices are row stochastic; the normalized matrix of maximum in-forests is the eigenprojection of the L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0508178","kind":"arxiv","version":2},"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/math/0508178/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":"math/0508178","created_at":"2026-07-04T14:50:36.503092+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0508178v2","created_at":"2026-07-04T14:50:36.503092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0508178","created_at":"2026-07-04T14:50:36.503092+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNLXT3OLLBUD","created_at":"2026-07-04T14:50:36.503092+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNLXT3OLLBUDFAXN","created_at":"2026-07-04T14:50:36.503092+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNLXT3OL","created_at":"2026-07-04T14:50:36.503092+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/MNLXT3OLLBUDFAXN2SGLL6CDBM","json":"https://pith.science/pith/MNLXT3OLLBUDFAXN2SGLL6CDBM.json","graph_json":"https://pith.science/api/pith-number/MNLXT3OLLBUDFAXN2SGLL6CDBM/graph.json","events_json":"https://pith.science/api/pith-number/MNLXT3OLLBUDFAXN2SGLL6CDBM/events.json","paper":"https://pith.science/paper/MNLXT3OL"},"agent_actions":{"view_html":"https://pith.science/pith/MNLXT3OLLBUDFAXN2SGLL6CDBM","download_json":"https://pith.science/pith/MNLXT3OLLBUDFAXN2SGLL6CDBM.json","view_paper":"https://pith.science/paper/MNLXT3OL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0508178&json=true","fetch_graph":"https://pith.science/api/pith-number/MNLXT3OLLBUDFAXN2SGLL6CDBM/graph.json","fetch_events":"https://pith.science/api/pith-number/MNLXT3OLLBUDFAXN2SGLL6CDBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNLXT3OLLBUDFAXN2SGLL6CDBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNLXT3OLLBUDFAXN2SGLL6CDBM/action/storage_attestation","attest_author":"https://pith.science/pith/MNLXT3OLLBUDFAXN2SGLL6CDBM/action/author_attestation","sign_citation":"https://pith.science/pith/MNLXT3OLLBUDFAXN2SGLL6CDBM/action/citation_signature","submit_replication":"https://pith.science/pith/MNLXT3OLLBUDFAXN2SGLL6CDBM/action/replication_record"}},"created_at":"2026-07-04T14:50:36.503092+00:00","updated_at":"2026-07-04T14:50:36.503092+00:00"}