{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AR6HN7OGQOCO3J5EJ5FGAIKYA4","short_pith_number":"pith:AR6HN7OG","schema_version":"1.0","canonical_sha256":"047c76fdc68384eda7a44f4a602158072e305b8e3499316b30552d3ffc3669d3","source":{"kind":"arxiv","id":"1009.3955","version":2},"attestation_state":"computed","paper":{"title":"Random Sequential Renormalization of Networks I: Application to Critical Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Golnoosh Bizhani, Maya Paczuski, Peter Grassberger, Vishal Sood","submitted_at":"2010-09-20T21:26:34Z","abstract_excerpt":"We introduce the concept of Random Sequential Renormalization (RSR) for arbitrary networks. RSR is a graph renormalization procedure that locally aggregates nodes to produce a coarse grained network. It is analogous to the (quasi-)parallel renormalization schemes introduced by C. Song {\\it et al.} (Nature {\\bf 433}, 392 (2005)) and studied more recently by F. Radicchi {\\it et al.} (Phys. Rev. Lett. {\\bf 101}, 148701 (2008)), but much simpler and easier to implement. In this first paper we apply RSR to critical trees and derive analytical results consistent with numerical simulations. Critical "},"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":"1009.3955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-09-20T21:26:34Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"69945cb6c5892771ef1d9329044f9c67f8bd6fa0039d7cbe2c2d3d6249098711","abstract_canon_sha256":"32cc0d5d2494a0f1674e7e83a82d41aba88474e85d3ab95fa512c23902a57dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:02.364323Z","signature_b64":"DiT5StkMD2wJvfMhe5uTpjYhLjc8Gw1GreA0d2qFUjeKlreEWRWeI9osfQ9tBut3bOof/TWD06UHlpTAZ2UsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047c76fdc68384eda7a44f4a602158072e305b8e3499316b30552d3ffc3669d3","last_reissued_at":"2026-05-18T04:26:02.363855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:02.363855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Sequential Renormalization of Networks I: Application to Critical Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Golnoosh Bizhani, Maya Paczuski, Peter Grassberger, Vishal Sood","submitted_at":"2010-09-20T21:26:34Z","abstract_excerpt":"We introduce the concept of Random Sequential Renormalization (RSR) for arbitrary networks. RSR is a graph renormalization procedure that locally aggregates nodes to produce a coarse grained network. It is analogous to the (quasi-)parallel renormalization schemes introduced by C. Song {\\it et al.} (Nature {\\bf 433}, 392 (2005)) and studied more recently by F. Radicchi {\\it et al.} (Phys. Rev. Lett. {\\bf 101}, 148701 (2008)), but much simpler and easier to implement. In this first paper we apply RSR to critical trees and derive analytical results consistent with numerical simulations. Critical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3955","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":""},"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":"1009.3955","created_at":"2026-05-18T04:26:02.363928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3955v2","created_at":"2026-05-18T04:26:02.363928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3955","created_at":"2026-05-18T04:26:02.363928+00:00"},{"alias_kind":"pith_short_12","alias_value":"AR6HN7OGQOCO","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AR6HN7OGQOCO3J5E","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AR6HN7OG","created_at":"2026-05-18T12:26:05.355336+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/AR6HN7OGQOCO3J5EJ5FGAIKYA4","json":"https://pith.science/pith/AR6HN7OGQOCO3J5EJ5FGAIKYA4.json","graph_json":"https://pith.science/api/pith-number/AR6HN7OGQOCO3J5EJ5FGAIKYA4/graph.json","events_json":"https://pith.science/api/pith-number/AR6HN7OGQOCO3J5EJ5FGAIKYA4/events.json","paper":"https://pith.science/paper/AR6HN7OG"},"agent_actions":{"view_html":"https://pith.science/pith/AR6HN7OGQOCO3J5EJ5FGAIKYA4","download_json":"https://pith.science/pith/AR6HN7OGQOCO3J5EJ5FGAIKYA4.json","view_paper":"https://pith.science/paper/AR6HN7OG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3955&json=true","fetch_graph":"https://pith.science/api/pith-number/AR6HN7OGQOCO3J5EJ5FGAIKYA4/graph.json","fetch_events":"https://pith.science/api/pith-number/AR6HN7OGQOCO3J5EJ5FGAIKYA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AR6HN7OGQOCO3J5EJ5FGAIKYA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AR6HN7OGQOCO3J5EJ5FGAIKYA4/action/storage_attestation","attest_author":"https://pith.science/pith/AR6HN7OGQOCO3J5EJ5FGAIKYA4/action/author_attestation","sign_citation":"https://pith.science/pith/AR6HN7OGQOCO3J5EJ5FGAIKYA4/action/citation_signature","submit_replication":"https://pith.science/pith/AR6HN7OGQOCO3J5EJ5FGAIKYA4/action/replication_record"}},"created_at":"2026-05-18T04:26:02.363928+00:00","updated_at":"2026-05-18T04:26:02.363928+00:00"}