{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:PQKSPSU6S7TM3EMG7RIK3LE7YQ","short_pith_number":"pith:PQKSPSU6","schema_version":"1.0","canonical_sha256":"7c1527ca9e97e6cd9186fc50adac9fc407ec1e32745c7d3c2fbcd0770aa50432","source":{"kind":"arxiv","id":"0902.1114","version":1},"attestation_state":"computed","paper":{"title":"A complementary view on the growth of directory trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Claudio J. Tessone, Frank Schweitzer, Markus M. Geipel","submitted_at":"2009-02-06T15:19:31Z","abstract_excerpt":"Trees are a special sub-class of networks with unique properties, such as the level distribution which has often been overlooked. We analyse a general tree growth model proposed by Klemm {\\em et. al.} (2005) to explain the growth of user-generated directory structures in computers. The model has a single parameter $q$ which interpolates between preferential attachment and random growth. Our analysis results in three contributions: First, we propose a more efficient estimation method for $q$ based on the degree distribution, which is one specific representation of the model. Next, we introduce "},"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":"0902.1114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-02-06T15:19:31Z","cross_cats_sorted":[],"title_canon_sha256":"bf1166123db6bb268baff7889876b6f7f639a4d01fe12426920d57069c921fad","abstract_canon_sha256":"ab43a07c53406ff8f34646b1e5a52aa3c7784a82e159f1b7b3c860796d0632c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:48.997789Z","signature_b64":"KE8jH/vhQ089Bxm/th7Ofjlzzx+eG4sgHk9nYfK400FJKTmEBSIb5BUQhvYQrAEQ92zb4YP++s4mM3RadEnsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c1527ca9e97e6cd9186fc50adac9fc407ec1e32745c7d3c2fbcd0770aa50432","last_reissued_at":"2026-05-18T02:14:48.997398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:48.997398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A complementary view on the growth of directory trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Claudio J. Tessone, Frank Schweitzer, Markus M. Geipel","submitted_at":"2009-02-06T15:19:31Z","abstract_excerpt":"Trees are a special sub-class of networks with unique properties, such as the level distribution which has often been overlooked. We analyse a general tree growth model proposed by Klemm {\\em et. al.} (2005) to explain the growth of user-generated directory structures in computers. The model has a single parameter $q$ which interpolates between preferential attachment and random growth. Our analysis results in three contributions: First, we propose a more efficient estimation method for $q$ based on the degree distribution, which is one specific representation of the model. Next, we introduce "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1114","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":""},"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":"0902.1114","created_at":"2026-05-18T02:14:48.997459+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.1114v1","created_at":"2026-05-18T02:14:48.997459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1114","created_at":"2026-05-18T02:14:48.997459+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQKSPSU6S7TM","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQKSPSU6S7TM3EMG","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQKSPSU6","created_at":"2026-05-18T12:26:01.383474+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/PQKSPSU6S7TM3EMG7RIK3LE7YQ","json":"https://pith.science/pith/PQKSPSU6S7TM3EMG7RIK3LE7YQ.json","graph_json":"https://pith.science/api/pith-number/PQKSPSU6S7TM3EMG7RIK3LE7YQ/graph.json","events_json":"https://pith.science/api/pith-number/PQKSPSU6S7TM3EMG7RIK3LE7YQ/events.json","paper":"https://pith.science/paper/PQKSPSU6"},"agent_actions":{"view_html":"https://pith.science/pith/PQKSPSU6S7TM3EMG7RIK3LE7YQ","download_json":"https://pith.science/pith/PQKSPSU6S7TM3EMG7RIK3LE7YQ.json","view_paper":"https://pith.science/paper/PQKSPSU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.1114&json=true","fetch_graph":"https://pith.science/api/pith-number/PQKSPSU6S7TM3EMG7RIK3LE7YQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PQKSPSU6S7TM3EMG7RIK3LE7YQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQKSPSU6S7TM3EMG7RIK3LE7YQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQKSPSU6S7TM3EMG7RIK3LE7YQ/action/storage_attestation","attest_author":"https://pith.science/pith/PQKSPSU6S7TM3EMG7RIK3LE7YQ/action/author_attestation","sign_citation":"https://pith.science/pith/PQKSPSU6S7TM3EMG7RIK3LE7YQ/action/citation_signature","submit_replication":"https://pith.science/pith/PQKSPSU6S7TM3EMG7RIK3LE7YQ/action/replication_record"}},"created_at":"2026-05-18T02:14:48.997459+00:00","updated_at":"2026-05-18T02:14:48.997459+00:00"}