{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DUJFLMCU54R3SDRGUEJWQIWRL7","short_pith_number":"pith:DUJFLMCU","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"},"canonical_sha256":"1d1255b054ef23b90e26a1136822d15fe08f06eb3ac0cbfdae642f3a7b8cd1d7","source":{"kind":"arxiv","id":"0911.4285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4285","created_at":"2026-05-18T02:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4285v1","created_at":"2026-05-18T02:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4285","created_at":"2026-05-18T02:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"DUJFLMCU54R3","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DUJFLMCU54R3SDRG","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DUJFLMCU","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DUJFLMCU54R3SDRGUEJWQIWRL7","target":"record","payload":{"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"},"canonical_sha256":"1d1255b054ef23b90e26a1136822d15fe08f06eb3ac0cbfdae642f3a7b8cd1d7","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"},"source_kind":"arxiv","source_id":"0911.4285","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSvSB46s+JUfZxUKKLbPxD+S9uPlR/3PpJ6qfiBE2VSokHXZ8HwMIfMfVXPdOelZqaWgmH2liQ3J4nrCP8zECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:47:47.636896Z"},"content_sha256":"0237c9cf11300d0be3ca2fb313316ec2a8bcee47524d2e0045388dc3778c1fa2","schema_version":"1.0","event_id":"sha256:0237c9cf11300d0be3ca2fb313316ec2a8bcee47524d2e0045388dc3778c1fa2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DUJFLMCU54R3SDRGUEJWQIWRL7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kw5mBKK/4Z8EgFDUeMKKsg1/OKp3e0+yWeKFvas37LuNfjywAFmBj+0jkamVM2DV0hXBEe+8aKF/X+awHOUSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:47:47.637228Z"},"content_sha256":"d7c1505adc213b5a4a98bfc1207fcc893740b835462200ae7c07b9de0d69900a","schema_version":"1.0","event_id":"sha256:d7c1505adc213b5a4a98bfc1207fcc893740b835462200ae7c07b9de0d69900a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/bundle.json","state_url":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T05:47:47Z","links":{"resolver":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7","bundle":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/bundle.json","state":"https://pith.science/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUJFLMCU54R3SDRGUEJWQIWRL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DUJFLMCU54R3SDRGUEJWQIWRL7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7d02dcdc47eb54cdf8950dd38ba6e9c77e95a044f62ec9a34b9b233a6796ad8f","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-11-22T20:14:37Z","title_canon_sha256":"a8c19963e138ae19cfb5eca4708cc6ff90009308f780f9b182adc6c2b8f65126"},"schema_version":"1.0","source":{"id":"0911.4285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4285","created_at":"2026-05-18T02:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4285v1","created_at":"2026-05-18T02:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4285","created_at":"2026-05-18T02:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"DUJFLMCU54R3","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DUJFLMCU54R3SDRG","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DUJFLMCU","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:d7c1505adc213b5a4a98bfc1207fcc893740b835462200ae7c07b9de0d69900a","target":"graph","created_at":"2026-05-18T02:10:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"A. L. Ferreira, A. V. Goltsev, J. F. F. Mendes, S. N. Dorogovtsev","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-11-22T20:14:37Z","title":"Zero Pearson Coefficient for Strongly Correlated Growing Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4285","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0237c9cf11300d0be3ca2fb313316ec2a8bcee47524d2e0045388dc3778c1fa2","target":"record","created_at":"2026-05-18T02:10:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7d02dcdc47eb54cdf8950dd38ba6e9c77e95a044f62ec9a34b9b233a6796ad8f","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-11-22T20:14:37Z","title_canon_sha256":"a8c19963e138ae19cfb5eca4708cc6ff90009308f780f9b182adc6c2b8f65126"},"schema_version":"1.0","source":{"id":"0911.4285","kind":"arxiv","version":1}},"canonical_sha256":"1d1255b054ef23b90e26a1136822d15fe08f06eb3ac0cbfdae642f3a7b8cd1d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d1255b054ef23b90e26a1136822d15fe08f06eb3ac0cbfdae642f3a7b8cd1d7","first_computed_at":"2026-05-18T02:10:37.656010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:10:37.656010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ftfAL/SvnQlkxpAKY45WfOe0ru41OeNOz1KeF5H5T7aClW8A3ljr0pa1bSmBDO4W0vCwnUa2fpecn7/GlINrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:10:37.656721Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0237c9cf11300d0be3ca2fb313316ec2a8bcee47524d2e0045388dc3778c1fa2","sha256:d7c1505adc213b5a4a98bfc1207fcc893740b835462200ae7c07b9de0d69900a"],"state_sha256":"bc56e7fdd08d9d7e0a2ffd4d21ca0e22765fa7c85f4c26ed3e74a70684c5500c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovVp6UkNVrIOVIY+p7+O1W9QOeWznxc2NBdi9UDqIFbDJU/PTr/4zr5Iis+xgmH/n92iAPSUQQdoPULwZG/nCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:47:47.639322Z","bundle_sha256":"ccf5590ff0469fd9133766a2ff69d92dcb93752012b466cbec73004cbcbe8c41"}}