{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6R5VGXW4AQFIEWPXVKPVOP6GXI","short_pith_number":"pith:6R5VGXW4","schema_version":"1.0","canonical_sha256":"f47b535edc040a8259f7aa9f573fc6ba123aa30ee10f37211e888af73e375223","source":{"kind":"arxiv","id":"1505.00985","version":2},"attestation_state":"computed","paper":{"title":"Models of random graph hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Janusz Holyst, Krzysztof Suchecki, Robert Paluch","submitted_at":"2015-05-05T12:34:05Z","abstract_excerpt":"We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erd\\H{o}s-R\\'{e}nyi random graph, with a fixed average degree equal to a system parameter $c$. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size $1$, when building the next hierarchy level, while in 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":"1505.00985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-05-05T12:34:05Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"3c200bf82e047a37da3aeb925a25f4ad641f99c7588634e82ff613aaf791eed7","abstract_canon_sha256":"e031f74438de2de2cfb1dedb305ea57fca8e1c1faebe9607268ea4cb52162a48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:03.520866Z","signature_b64":"28iHZ4QL7zzbnWo+mUQ+hWnRzEg49m9jtlUuPyb4Lf33pdTRIgW1Kiw7yEIM4aR9bOQldB9sATCg/MMi+3zTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f47b535edc040a8259f7aa9f573fc6ba123aa30ee10f37211e888af73e375223","last_reissued_at":"2026-05-18T01:36:03.520337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:03.520337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Models of random graph hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Janusz Holyst, Krzysztof Suchecki, Robert Paluch","submitted_at":"2015-05-05T12:34:05Z","abstract_excerpt":"We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erd\\H{o}s-R\\'{e}nyi random graph, with a fixed average degree equal to a system parameter $c$. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size $1$, when building the next hierarchy level, while in the L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00985","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":"1505.00985","created_at":"2026-05-18T01:36:03.520419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00985v2","created_at":"2026-05-18T01:36:03.520419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00985","created_at":"2026-05-18T01:36:03.520419+00:00"},{"alias_kind":"pith_short_12","alias_value":"6R5VGXW4AQFI","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6R5VGXW4AQFIEWPX","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6R5VGXW4","created_at":"2026-05-18T12:29:07.941421+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/6R5VGXW4AQFIEWPXVKPVOP6GXI","json":"https://pith.science/pith/6R5VGXW4AQFIEWPXVKPVOP6GXI.json","graph_json":"https://pith.science/api/pith-number/6R5VGXW4AQFIEWPXVKPVOP6GXI/graph.json","events_json":"https://pith.science/api/pith-number/6R5VGXW4AQFIEWPXVKPVOP6GXI/events.json","paper":"https://pith.science/paper/6R5VGXW4"},"agent_actions":{"view_html":"https://pith.science/pith/6R5VGXW4AQFIEWPXVKPVOP6GXI","download_json":"https://pith.science/pith/6R5VGXW4AQFIEWPXVKPVOP6GXI.json","view_paper":"https://pith.science/paper/6R5VGXW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00985&json=true","fetch_graph":"https://pith.science/api/pith-number/6R5VGXW4AQFIEWPXVKPVOP6GXI/graph.json","fetch_events":"https://pith.science/api/pith-number/6R5VGXW4AQFIEWPXVKPVOP6GXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6R5VGXW4AQFIEWPXVKPVOP6GXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6R5VGXW4AQFIEWPXVKPVOP6GXI/action/storage_attestation","attest_author":"https://pith.science/pith/6R5VGXW4AQFIEWPXVKPVOP6GXI/action/author_attestation","sign_citation":"https://pith.science/pith/6R5VGXW4AQFIEWPXVKPVOP6GXI/action/citation_signature","submit_replication":"https://pith.science/pith/6R5VGXW4AQFIEWPXVKPVOP6GXI/action/replication_record"}},"created_at":"2026-05-18T01:36:03.520419+00:00","updated_at":"2026-05-18T01:36:03.520419+00:00"}