{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DUJFLMCU54R3SDRGUEJWQIWRL7","short_pith_number":"pith:DUJFLMCU","schema_version":"1.0","canonical_sha256":"1d1255b054ef23b90e26a1136822d15fe08f06eb3ac0cbfdae642f3a7b8cd1d7","source":{"kind":"arxiv","id":"0911.4285","version":1},"attestation_state":"computed","paper":{"title":"Zero Pearson Coefficient for Strongly Correlated Growing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"A. L. Ferreira, A. V. Goltsev, J. F. F. Mendes, S. N. Dorogovtsev","submitted_at":"2009-11-22T20:14:37Z","abstract_excerpt":"We obtained Pearson's coefficient of strongly correlated recursive networks growing by preferential attachment of every new vertex by $m$ edges. We found that the Pearson coefficient is exactly zero in the infinite network limit for the recursive trees ($m=1$). If the number of connections of new vertices exceeds one ($m>1$), then the Pearson coefficient in the infinite networks equals zero only when the degree distribution exponent $\\gamma$ does not exceed 4. We calculated the Pearson coefficient for finite networks and observed a slow, power-law like approach to an infinite network limit. Ou"},"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":"0911.4285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-11-22T20:14:37Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"a8c19963e138ae19cfb5eca4708cc6ff90009308f780f9b182adc6c2b8f65126","abstract_canon_sha256":"7d02dcdc47eb54cdf8950dd38ba6e9c77e95a044f62ec9a34b9b233a6796ad8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:10:37.656721Z","signature_b64":"ftfAL/SvnQlkxpAKY45WfOe0ru41OeNOz1KeF5H5T7aClW8A3ljr0pa1bSmBDO4W0vCwnUa2fpecn7/GlINrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1255b054ef23b90e26a1136822d15fe08f06eb3ac0cbfdae642f3a7b8cd1d7","last_reissued_at":"2026-05-18T02:10:37.656010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:10:37.656010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero Pearson Coefficient for Strongly Correlated Growing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"A. L. Ferreira, A. V. Goltsev, J. F. F. Mendes, S. N. Dorogovtsev","submitted_at":"2009-11-22T20:14:37Z","abstract_excerpt":"We obtained Pearson's coefficient of strongly correlated recursive networks growing by preferential attachment of every new vertex by $m$ edges. We found that the Pearson coefficient is exactly zero in the infinite network limit for the recursive trees ($m=1$). If the number of connections of new vertices exceeds one ($m>1$), then the Pearson coefficient in the infinite networks equals zero only when the degree distribution exponent $\\gamma$ does not exceed 4. We calculated the Pearson coefficient for finite networks and observed a slow, power-law like approach to an infinite network limit. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4285","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":"0911.4285","created_at":"2026-05-18T02:10:37.656109+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4285v1","created_at":"2026-05-18T02:10:37.656109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4285","created_at":"2026-05-18T02:10:37.656109+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUJFLMCU54R3","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUJFLMCU54R3SDRG","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUJFLMCU","created_at":"2026-05-18T12:25:59.703012+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/DUJFLMCU54R3SDRGUEJWQIWRL7","json":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7.json","graph_json":"https://pith.science/api/pith-number/DUJFLMCU54R3SDRGUEJWQIWRL7/graph.json","events_json":"https://pith.science/api/pith-number/DUJFLMCU54R3SDRGUEJWQIWRL7/events.json","paper":"https://pith.science/paper/DUJFLMCU"},"agent_actions":{"view_html":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7","download_json":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7.json","view_paper":"https://pith.science/paper/DUJFLMCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4285&json=true","fetch_graph":"https://pith.science/api/pith-number/DUJFLMCU54R3SDRGUEJWQIWRL7/graph.json","fetch_events":"https://pith.science/api/pith-number/DUJFLMCU54R3SDRGUEJWQIWRL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/action/storage_attestation","attest_author":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/action/author_attestation","sign_citation":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/action/citation_signature","submit_replication":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/action/replication_record"}},"created_at":"2026-05-18T02:10:37.656109+00:00","updated_at":"2026-05-18T02:10:37.656109+00:00"}