{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CEPOKD5EI7MNLERJBR7REQO2GK","short_pith_number":"pith:CEPOKD5E","schema_version":"1.0","canonical_sha256":"111ee50fa447d8d592290c7f1241da32b571ec60f574a5a6f6d6abf61d14cdca","source":{"kind":"arxiv","id":"2410.22969","version":1},"attestation_state":"computed","paper":{"title":"Elephant random walks with graph based shared memory: First and second order asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"math.PR","authors_text":"Deborshi Das","submitted_at":"2024-10-30T12:36:59Z","abstract_excerpt":"We consider a generalization of the so-called elephant random walk by introducing multiple elephants moving along the integer line, $\\mathbb{Z}$. When taking a new step, each elephant considers not only its own previous steps but also the past steps of other elephants. The dynamics of \"who follows whom\" are governed by a directed graph, where each vertex represents an elephant, and the edges indicate that an elephant will consider the past steps of its in-neighbour elephants when deciding its next move. In other words, this model involves a collection of reinforced random walks evolving throug"},"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":"2410.22969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-10-30T12:36:59Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"20949e005e00dbfaa0c6f460e256e9efc3aa4e64146617b5d27e5e915edbfe67","abstract_canon_sha256":"17a584c82d0db2019ce36f117f247f1b3c504ebd0ea9bc5d525fa24d3159ad33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:39.159056Z","signature_b64":"JIwzHt0HpFONXpIxHHOpJWh5OWlGXFbWYco2FWXuBy3sUJjkMqSb3f3JqJHvHL/zdAPnqbvBJXAZsN0Th7/SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111ee50fa447d8d592290c7f1241da32b571ec60f574a5a6f6d6abf61d14cdca","last_reissued_at":"2026-07-05T09:28:39.158676Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:39.158676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elephant random walks with graph based shared memory: First and second order asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"math.PR","authors_text":"Deborshi Das","submitted_at":"2024-10-30T12:36:59Z","abstract_excerpt":"We consider a generalization of the so-called elephant random walk by introducing multiple elephants moving along the integer line, $\\mathbb{Z}$. When taking a new step, each elephant considers not only its own previous steps but also the past steps of other elephants. The dynamics of \"who follows whom\" are governed by a directed graph, where each vertex represents an elephant, and the edges indicate that an elephant will consider the past steps of its in-neighbour elephants when deciding its next move. In other words, this model involves a collection of reinforced random walks evolving throug"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22969","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/2410.22969/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":"2410.22969","created_at":"2026-07-05T09:28:39.158733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.22969v1","created_at":"2026-07-05T09:28:39.158733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22969","created_at":"2026-07-05T09:28:39.158733+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEPOKD5EI7MN","created_at":"2026-07-05T09:28:39.158733+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEPOKD5EI7MNLERJ","created_at":"2026-07-05T09:28:39.158733+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEPOKD5E","created_at":"2026-07-05T09:28:39.158733+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17302","citing_title":"Elephant random walk with attributed steps and extractions of random sizes","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK","json":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK.json","graph_json":"https://pith.science/api/pith-number/CEPOKD5EI7MNLERJBR7REQO2GK/graph.json","events_json":"https://pith.science/api/pith-number/CEPOKD5EI7MNLERJBR7REQO2GK/events.json","paper":"https://pith.science/paper/CEPOKD5E"},"agent_actions":{"view_html":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK","download_json":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK.json","view_paper":"https://pith.science/paper/CEPOKD5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.22969&json=true","fetch_graph":"https://pith.science/api/pith-number/CEPOKD5EI7MNLERJBR7REQO2GK/graph.json","fetch_events":"https://pith.science/api/pith-number/CEPOKD5EI7MNLERJBR7REQO2GK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK/action/storage_attestation","attest_author":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK/action/author_attestation","sign_citation":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK/action/citation_signature","submit_replication":"https://pith.science/pith/CEPOKD5EI7MNLERJBR7REQO2GK/action/replication_record"}},"created_at":"2026-07-05T09:28:39.158733+00:00","updated_at":"2026-07-05T09:28:39.158733+00:00"}