{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2W4H22MARCUQP5DHG3ALTQHKQT","short_pith_number":"pith:2W4H22MA","schema_version":"1.0","canonical_sha256":"d5b87d698088a907f46736c0b9c0ea84d44c76bdd19b806bc470ad07dc3ba9a7","source":{"kind":"arxiv","id":"1312.3897","version":2},"attestation_state":"computed","paper":{"title":"Constrained information transmission on Erd\\\"os-R\\'enyi graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christophe Gallesco, Francis Comets, Marina Vachkovskaia, Serguei Popov","submitted_at":"2013-12-13T18:24:29Z","abstract_excerpt":"We model the transmission of information of a message on the Erd\\\"os-R\\'eny random graph with parameters $(n,p)$ and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a random emission capital that decreases by one at each emission. We examine two natural dynamics: in the first dynamics, an informed server performs its attempts, then checks at each of them if the corresponding edge is open or not; in the second dynamics the informed server knows a priori who are its neighbors, and it performs all its attempts on its actual ne"},"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":"1312.3897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-13T18:24:29Z","cross_cats_sorted":[],"title_canon_sha256":"83ac79dcc22db3d3a2c9891eaaf623eaad040641fcb1a17837b5a709c7119bd8","abstract_canon_sha256":"b5b2c2a35d2be334f4bcb41386f7200ba7204bf52fd4bc6b23b5ea65a65baa64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:10.681920Z","signature_b64":"MvSCmpSvnvGtHpbNwLuXTTUfr8WMWzIhmdVAGCkLABatknS7mJmCeS0+g7Olj9t6+DPVd+pU6DxzaOL3W5P2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5b87d698088a907f46736c0b9c0ea84d44c76bdd19b806bc470ad07dc3ba9a7","last_reissued_at":"2026-05-18T01:22:10.681304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:10.681304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained information transmission on Erd\\\"os-R\\'enyi graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christophe Gallesco, Francis Comets, Marina Vachkovskaia, Serguei Popov","submitted_at":"2013-12-13T18:24:29Z","abstract_excerpt":"We model the transmission of information of a message on the Erd\\\"os-R\\'eny random graph with parameters $(n,p)$ and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a random emission capital that decreases by one at each emission. We examine two natural dynamics: in the first dynamics, an informed server performs its attempts, then checks at each of them if the corresponding edge is open or not; in the second dynamics the informed server knows a priori who are its neighbors, and it performs all its attempts on its actual ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3897","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":"1312.3897","created_at":"2026-05-18T01:22:10.681402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3897v2","created_at":"2026-05-18T01:22:10.681402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3897","created_at":"2026-05-18T01:22:10.681402+00:00"},{"alias_kind":"pith_short_12","alias_value":"2W4H22MARCUQ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2W4H22MARCUQP5DH","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2W4H22MA","created_at":"2026-05-18T12:27:32.513160+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/2W4H22MARCUQP5DHG3ALTQHKQT","json":"https://pith.science/pith/2W4H22MARCUQP5DHG3ALTQHKQT.json","graph_json":"https://pith.science/api/pith-number/2W4H22MARCUQP5DHG3ALTQHKQT/graph.json","events_json":"https://pith.science/api/pith-number/2W4H22MARCUQP5DHG3ALTQHKQT/events.json","paper":"https://pith.science/paper/2W4H22MA"},"agent_actions":{"view_html":"https://pith.science/pith/2W4H22MARCUQP5DHG3ALTQHKQT","download_json":"https://pith.science/pith/2W4H22MARCUQP5DHG3ALTQHKQT.json","view_paper":"https://pith.science/paper/2W4H22MA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3897&json=true","fetch_graph":"https://pith.science/api/pith-number/2W4H22MARCUQP5DHG3ALTQHKQT/graph.json","fetch_events":"https://pith.science/api/pith-number/2W4H22MARCUQP5DHG3ALTQHKQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2W4H22MARCUQP5DHG3ALTQHKQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2W4H22MARCUQP5DHG3ALTQHKQT/action/storage_attestation","attest_author":"https://pith.science/pith/2W4H22MARCUQP5DHG3ALTQHKQT/action/author_attestation","sign_citation":"https://pith.science/pith/2W4H22MARCUQP5DHG3ALTQHKQT/action/citation_signature","submit_replication":"https://pith.science/pith/2W4H22MARCUQP5DHG3ALTQHKQT/action/replication_record"}},"created_at":"2026-05-18T01:22:10.681402+00:00","updated_at":"2026-05-18T01:22:10.681402+00:00"}