{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:3NLOIHUZHODFV2Q2CQMIVT5PFZ","short_pith_number":"pith:3NLOIHUZ","schema_version":"1.0","canonical_sha256":"db56e41e993b865aea1a14188acfaf2e42c43991295a3dd2bc8e7cdc2fc82dc1","source":{"kind":"arxiv","id":"math/0603412","version":2},"attestation_state":"computed","paper":{"title":"Weak survival for branching random walks on graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniela Bertacchi, Fabio Zucca","submitted_at":"2006-03-16T22:24:28Z","abstract_excerpt":"We study weak and strong survival for branching random walks on multigraphs. We prove that, for a large class of multigraphs, weak survival is related to a geometrical parameter of the multigraph and that the existence of a pure weak phase is equivalent to nonamenability. Finally we study weak and strong critical behaviors of the branching random walk."},"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":"math/0603412","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-03-16T22:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"762ff8b993aa84ae68c8712a27b14c46f2a03bcb4dd3f466872d62ebf9419568","abstract_canon_sha256":"a58c3f76ecec40923abb23b9d5289952f70a1bbc2503d7aa4a15435fc5e6705c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:00.296010Z","signature_b64":"XUOZZX/6jmhPYu5XCZNultYOpO9RD2Am36MphGbVKU0icIixrh5WG9V7YXMCXHnKd+4zm/0BF5XSJBLVaFiwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db56e41e993b865aea1a14188acfaf2e42c43991295a3dd2bc8e7cdc2fc82dc1","last_reissued_at":"2026-05-18T04:31:00.295080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:00.295080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak survival for branching random walks on graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniela Bertacchi, Fabio Zucca","submitted_at":"2006-03-16T22:24:28Z","abstract_excerpt":"We study weak and strong survival for branching random walks on multigraphs. We prove that, for a large class of multigraphs, weak survival is related to a geometrical parameter of the multigraph and that the existence of a pure weak phase is equivalent to nonamenability. Finally we study weak and strong critical behaviors of the branching random walk."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0603412","kind":"arxiv","version":2},"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":"math/0603412","created_at":"2026-05-18T04:31:00.295249+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0603412v2","created_at":"2026-05-18T04:31:00.295249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0603412","created_at":"2026-05-18T04:31:00.295249+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NLOIHUZHODF","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NLOIHUZHODFV2Q2","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NLOIHUZ","created_at":"2026-05-18T12:25:53.939244+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/3NLOIHUZHODFV2Q2CQMIVT5PFZ","json":"https://pith.science/pith/3NLOIHUZHODFV2Q2CQMIVT5PFZ.json","graph_json":"https://pith.science/api/pith-number/3NLOIHUZHODFV2Q2CQMIVT5PFZ/graph.json","events_json":"https://pith.science/api/pith-number/3NLOIHUZHODFV2Q2CQMIVT5PFZ/events.json","paper":"https://pith.science/paper/3NLOIHUZ"},"agent_actions":{"view_html":"https://pith.science/pith/3NLOIHUZHODFV2Q2CQMIVT5PFZ","download_json":"https://pith.science/pith/3NLOIHUZHODFV2Q2CQMIVT5PFZ.json","view_paper":"https://pith.science/paper/3NLOIHUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0603412&json=true","fetch_graph":"https://pith.science/api/pith-number/3NLOIHUZHODFV2Q2CQMIVT5PFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3NLOIHUZHODFV2Q2CQMIVT5PFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NLOIHUZHODFV2Q2CQMIVT5PFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NLOIHUZHODFV2Q2CQMIVT5PFZ/action/storage_attestation","attest_author":"https://pith.science/pith/3NLOIHUZHODFV2Q2CQMIVT5PFZ/action/author_attestation","sign_citation":"https://pith.science/pith/3NLOIHUZHODFV2Q2CQMIVT5PFZ/action/citation_signature","submit_replication":"https://pith.science/pith/3NLOIHUZHODFV2Q2CQMIVT5PFZ/action/replication_record"}},"created_at":"2026-05-18T04:31:00.295249+00:00","updated_at":"2026-05-18T04:31:00.295249+00:00"}