{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NC5JUUIW2PQL5CTT62LT5GWGUE","short_pith_number":"pith:NC5JUUIW","schema_version":"1.0","canonical_sha256":"68ba9a5116d3e0be8a73f6973e9ac6a1282a1d1500fe202158cb81f54df02588","source":{"kind":"arxiv","id":"1501.05814","version":1},"attestation_state":"computed","paper":{"title":"Infinite Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Emmanuel Jeandel (INRIA Nancy - Grand Est / LORIA), Pierre Guillon (I2M)","submitted_at":"2015-01-23T14:39:15Z","abstract_excerpt":"Suppose that Alice and Bob are given each an infinite string, and they want to decide whether their two strings are in a given relation. How much communication do they need? How can communication be even defined and measured for infinite strings? In this article, we propose a formalism for a notion of infinite communication complexity, prove that it satisfies some natural properties and coincides, for relevant applications, with the classical notion of amortized communication complexity. More-over, an application is given for tackling some conjecture about tilings and multidimensional sofic sh"},"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":"1501.05814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-23T14:39:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6320133bedb1d796d335a84aa5de8dd382daf7f435fadb42ac02dd357e06d643","abstract_canon_sha256":"e8af7ba7215d92f9094efa614c6f3d7ea6778e3b8865a32a5164746fdc0ea85c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:48.903877Z","signature_b64":"OilJ74E2eqaU5y89X3O9MZtW3Dpq1Tj39teovNHtsc6FLqW+KJkKInY5vi8CeTgbwfOgtovJHJ9Sj625mCeUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68ba9a5116d3e0be8a73f6973e9ac6a1282a1d1500fe202158cb81f54df02588","last_reissued_at":"2026-05-18T02:28:48.903510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:48.903510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Emmanuel Jeandel (INRIA Nancy - Grand Est / LORIA), Pierre Guillon (I2M)","submitted_at":"2015-01-23T14:39:15Z","abstract_excerpt":"Suppose that Alice and Bob are given each an infinite string, and they want to decide whether their two strings are in a given relation. How much communication do they need? How can communication be even defined and measured for infinite strings? In this article, we propose a formalism for a notion of infinite communication complexity, prove that it satisfies some natural properties and coincides, for relevant applications, with the classical notion of amortized communication complexity. More-over, an application is given for tackling some conjecture about tilings and multidimensional sofic sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05814","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.05814","created_at":"2026-05-18T02:28:48.903566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05814v1","created_at":"2026-05-18T02:28:48.903566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05814","created_at":"2026-05-18T02:28:48.903566+00:00"},{"alias_kind":"pith_short_12","alias_value":"NC5JUUIW2PQL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NC5JUUIW2PQL5CTT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NC5JUUIW","created_at":"2026-05-18T12:29:32.376354+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/NC5JUUIW2PQL5CTT62LT5GWGUE","json":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE.json","graph_json":"https://pith.science/api/pith-number/NC5JUUIW2PQL5CTT62LT5GWGUE/graph.json","events_json":"https://pith.science/api/pith-number/NC5JUUIW2PQL5CTT62LT5GWGUE/events.json","paper":"https://pith.science/paper/NC5JUUIW"},"agent_actions":{"view_html":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE","download_json":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE.json","view_paper":"https://pith.science/paper/NC5JUUIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05814&json=true","fetch_graph":"https://pith.science/api/pith-number/NC5JUUIW2PQL5CTT62LT5GWGUE/graph.json","fetch_events":"https://pith.science/api/pith-number/NC5JUUIW2PQL5CTT62LT5GWGUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/action/storage_attestation","attest_author":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/action/author_attestation","sign_citation":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/action/citation_signature","submit_replication":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/action/replication_record"}},"created_at":"2026-05-18T02:28:48.903566+00:00","updated_at":"2026-05-18T02:28:48.903566+00:00"}