{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JBBCACTH4REKMBFMCPWMTTSKRO","short_pith_number":"pith:JBBCACTH","schema_version":"1.0","canonical_sha256":"4842200a67e448a604ac13ecc9ce4a8baf2f228165a73fc4b5bea09a4dff2179","source":{"kind":"arxiv","id":"2302.07093","version":2},"attestation_state":"computed","paper":{"title":"Laplacian Coarse Graining in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alan Albert Piovesana, Jos\\'e Ant\\^onio Brum, Matheus de C. Loures","submitted_at":"2023-02-14T14:46:31Z","abstract_excerpt":"Complex networks can model a range of different systems, from the human brain to social connections. Some of those networks have a large number of nodes and links, making it impractical to analyze them directly. One strategy to simplify these systems is by creating miniaturized versions of the networks that keep their main properties. A convenient tool that applies that strategy is the renormalization group (RG), a methodology used in statistical physics to change the scales of physical systems. This method consists of two steps: a coarse grain, where one reduces the size of the system, and a "},"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":"2302.07093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2023-02-14T14:46:31Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"09f7c9aaf17dc67dad2436d0a2da448e54b47f95eb521f3f78b4175ef69a6b5e","abstract_canon_sha256":"8bc766c99d3ccf3995936d1d75dc28d0604e5d2f9e4e9c7e04ea17043020cfce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:19.622116Z","signature_b64":"5uL6Pc+ucDhsUhmFrTaKOMVaKV/WZZX9lqfwYYpzQ0v4SaAcNRKP53pBfIdksvyqTfAaxYRPmxSMWkrtJQ+uCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4842200a67e448a604ac13ecc9ce4a8baf2f228165a73fc4b5bea09a4dff2179","last_reissued_at":"2026-07-05T05:58:19.621644Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:19.621644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Laplacian Coarse Graining in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alan Albert Piovesana, Jos\\'e Ant\\^onio Brum, Matheus de C. Loures","submitted_at":"2023-02-14T14:46:31Z","abstract_excerpt":"Complex networks can model a range of different systems, from the human brain to social connections. Some of those networks have a large number of nodes and links, making it impractical to analyze them directly. One strategy to simplify these systems is by creating miniaturized versions of the networks that keep their main properties. A convenient tool that applies that strategy is the renormalization group (RG), a methodology used in statistical physics to change the scales of physical systems. This method consists of two steps: a coarse grain, where one reduces the size of the system, and a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07093","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/2302.07093/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":"2302.07093","created_at":"2026-07-05T05:58:19.621716+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.07093v2","created_at":"2026-07-05T05:58:19.621716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07093","created_at":"2026-07-05T05:58:19.621716+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBBCACTH4REK","created_at":"2026-07-05T05:58:19.621716+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBBCACTH4REKMBFM","created_at":"2026-07-05T05:58:19.621716+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBBCACTH","created_at":"2026-07-05T05:58:19.621716+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24791","citing_title":"LAMG+: A Robust Lean Algebraic Multigrid Solver for Graph Laplacians","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2412.12988","citing_title":"Network Renormalization","ref_index":171,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO","json":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO.json","graph_json":"https://pith.science/api/pith-number/JBBCACTH4REKMBFMCPWMTTSKRO/graph.json","events_json":"https://pith.science/api/pith-number/JBBCACTH4REKMBFMCPWMTTSKRO/events.json","paper":"https://pith.science/paper/JBBCACTH"},"agent_actions":{"view_html":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO","download_json":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO.json","view_paper":"https://pith.science/paper/JBBCACTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.07093&json=true","fetch_graph":"https://pith.science/api/pith-number/JBBCACTH4REKMBFMCPWMTTSKRO/graph.json","fetch_events":"https://pith.science/api/pith-number/JBBCACTH4REKMBFMCPWMTTSKRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO/action/storage_attestation","attest_author":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO/action/author_attestation","sign_citation":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO/action/citation_signature","submit_replication":"https://pith.science/pith/JBBCACTH4REKMBFMCPWMTTSKRO/action/replication_record"}},"created_at":"2026-07-05T05:58:19.621716+00:00","updated_at":"2026-07-05T05:58:19.621716+00:00"}