{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:35MMFZ3SS4SE7VOIQSFBOHI43H","short_pith_number":"pith:35MMFZ3S","schema_version":"1.0","canonical_sha256":"df58c2e77297244fd5c8848a171d1cd9f6a1124a7a8d7c656ac2498d412efcd8","source":{"kind":"arxiv","id":"2605.21459","version":1},"attestation_state":"computed","paper":{"title":"Network evolution with self-reinforcement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Frank den Hollander, Remco van der Hofstad, Rounak Ray, Shankar Bhamidi","submitted_at":"2026-05-20T17:48:59Z","abstract_excerpt":"We study a new class of preferential attachment trees with \\emph{self-reinforcement}. At each time, each vertex is assigned a weight equal to the cumulative sum over past times of an affine function of its degree. A new vertex attaches itself via a single edge to an already present vertex with a probability proportional to the current weight of that vertex. This ``integrated popularity'' rule builds long memory directly into the attachment mechanism, thereby destroying the Markov and partial-exchangeability features that underlie the classical analysis of affine preferential attachment models."},"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":"2605.21459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-20T17:48:59Z","cross_cats_sorted":[],"title_canon_sha256":"8bde0cc3c48824c23bab9da57f5f2703fc7b143ee499f01a12e7d679263e684e","abstract_canon_sha256":"1fb7387fc9f233eb15659ea699b26a635be3116786adedf0ce6b7a4deffe4653"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T02:05:38.265907Z","signature_b64":"Z0OR6tKYScLS3q6baHMX/Jtlgln7EizJkj8fluf6VjzlUQDTGxup5sH0t0oh/7yxylzYvgUQSzEJKiLPJEzmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df58c2e77297244fd5c8848a171d1cd9f6a1124a7a8d7c656ac2498d412efcd8","last_reissued_at":"2026-05-21T02:05:38.265207Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T02:05:38.265207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network evolution with self-reinforcement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Frank den Hollander, Remco van der Hofstad, Rounak Ray, Shankar Bhamidi","submitted_at":"2026-05-20T17:48:59Z","abstract_excerpt":"We study a new class of preferential attachment trees with \\emph{self-reinforcement}. At each time, each vertex is assigned a weight equal to the cumulative sum over past times of an affine function of its degree. A new vertex attaches itself via a single edge to an already present vertex with a probability proportional to the current weight of that vertex. This ``integrated popularity'' rule builds long memory directly into the attachment mechanism, thereby destroying the Markov and partial-exchangeability features that underlie the classical analysis of affine preferential attachment models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21459","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21459/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.21459","created_at":"2026-05-21T02:05:38.265330+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21459v1","created_at":"2026-05-21T02:05:38.265330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21459","created_at":"2026-05-21T02:05:38.265330+00:00"},{"alias_kind":"pith_short_12","alias_value":"35MMFZ3SS4SE","created_at":"2026-05-21T02:05:38.265330+00:00"},{"alias_kind":"pith_short_16","alias_value":"35MMFZ3SS4SE7VOI","created_at":"2026-05-21T02:05:38.265330+00:00"},{"alias_kind":"pith_short_8","alias_value":"35MMFZ3S","created_at":"2026-05-21T02:05:38.265330+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/35MMFZ3SS4SE7VOIQSFBOHI43H","json":"https://pith.science/pith/35MMFZ3SS4SE7VOIQSFBOHI43H.json","graph_json":"https://pith.science/api/pith-number/35MMFZ3SS4SE7VOIQSFBOHI43H/graph.json","events_json":"https://pith.science/api/pith-number/35MMFZ3SS4SE7VOIQSFBOHI43H/events.json","paper":"https://pith.science/paper/35MMFZ3S"},"agent_actions":{"view_html":"https://pith.science/pith/35MMFZ3SS4SE7VOIQSFBOHI43H","download_json":"https://pith.science/pith/35MMFZ3SS4SE7VOIQSFBOHI43H.json","view_paper":"https://pith.science/paper/35MMFZ3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21459&json=true","fetch_graph":"https://pith.science/api/pith-number/35MMFZ3SS4SE7VOIQSFBOHI43H/graph.json","fetch_events":"https://pith.science/api/pith-number/35MMFZ3SS4SE7VOIQSFBOHI43H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35MMFZ3SS4SE7VOIQSFBOHI43H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35MMFZ3SS4SE7VOIQSFBOHI43H/action/storage_attestation","attest_author":"https://pith.science/pith/35MMFZ3SS4SE7VOIQSFBOHI43H/action/author_attestation","sign_citation":"https://pith.science/pith/35MMFZ3SS4SE7VOIQSFBOHI43H/action/citation_signature","submit_replication":"https://pith.science/pith/35MMFZ3SS4SE7VOIQSFBOHI43H/action/replication_record"}},"created_at":"2026-05-21T02:05:38.265330+00:00","updated_at":"2026-05-21T02:05:38.265330+00:00"}