{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NC5JUUIW2PQL5CTT62LT5GWGUE","short_pith_number":"pith:NC5JUUIW","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"},"canonical_sha256":"68ba9a5116d3e0be8a73f6973e9ac6a1282a1d1500fe202158cb81f54df02588","source":{"kind":"arxiv","id":"1501.05814","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05814","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05814v1","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05814","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"NC5JUUIW2PQL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NC5JUUIW2PQL5CTT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NC5JUUIW","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NC5JUUIW2PQL5CTT62LT5GWGUE","target":"record","payload":{"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"},"canonical_sha256":"68ba9a5116d3e0be8a73f6973e9ac6a1282a1d1500fe202158cb81f54df02588","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"},"source_kind":"arxiv","source_id":"1501.05814","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMRS/gYepk+gRZNGerMsODUpsCYWo0Q/jaXZaY8ZH28vIPDeez93UVWwbwU+lUw+vOzPPhw1s0xlRli6i6VaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:20:45.760999Z"},"content_sha256":"2d5dc71b84b658f352be194b3d50734a68d607cba8b94e4deb3540365c58b3f4","schema_version":"1.0","event_id":"sha256:2d5dc71b84b658f352be194b3d50734a68d607cba8b94e4deb3540365c58b3f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NC5JUUIW2PQL5CTT62LT5GWGUE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZKmFtmIOMPfnavMFbeZfrVEFVqZuU4TY4IkkgwO+ei17FSTTZFfyACz/ZZWk0glhFmE/jSL7Nfqn6LuLy0GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:20:45.761676Z"},"content_sha256":"0b554a452140977862d893233c539d6dab60b2deb505f6775ddf23f6cc879c25","schema_version":"1.0","event_id":"sha256:0b554a452140977862d893233c539d6dab60b2deb505f6775ddf23f6cc879c25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/bundle.json","state_url":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T12:20:45Z","links":{"resolver":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE","bundle":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/bundle.json","state":"https://pith.science/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NC5JUUIW2PQL5CTT62LT5GWGUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NC5JUUIW2PQL5CTT62LT5GWGUE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e8af7ba7215d92f9094efa614c6f3d7ea6778e3b8865a32a5164746fdc0ea85c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-23T14:39:15Z","title_canon_sha256":"6320133bedb1d796d335a84aa5de8dd382daf7f435fadb42ac02dd357e06d643"},"schema_version":"1.0","source":{"id":"1501.05814","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05814","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05814v1","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05814","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"NC5JUUIW2PQL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NC5JUUIW2PQL5CTT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NC5JUUIW","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:0b554a452140977862d893233c539d6dab60b2deb505f6775ddf23f6cc879c25","target":"graph","created_at":"2026-05-18T02:28:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Emmanuel Jeandel (INRIA Nancy - Grand Est / LORIA), Pierre Guillon (I2M)","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-23T14:39:15Z","title":"Infinite Communication Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05814","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2d5dc71b84b658f352be194b3d50734a68d607cba8b94e4deb3540365c58b3f4","target":"record","created_at":"2026-05-18T02:28:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e8af7ba7215d92f9094efa614c6f3d7ea6778e3b8865a32a5164746fdc0ea85c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-23T14:39:15Z","title_canon_sha256":"6320133bedb1d796d335a84aa5de8dd382daf7f435fadb42ac02dd357e06d643"},"schema_version":"1.0","source":{"id":"1501.05814","kind":"arxiv","version":1}},"canonical_sha256":"68ba9a5116d3e0be8a73f6973e9ac6a1282a1d1500fe202158cb81f54df02588","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68ba9a5116d3e0be8a73f6973e9ac6a1282a1d1500fe202158cb81f54df02588","first_computed_at":"2026-05-18T02:28:48.903510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:48.903510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OilJ74E2eqaU5y89X3O9MZtW3Dpq1Tj39teovNHtsc6FLqW+KJkKInY5vi8CeTgbwfOgtovJHJ9Sj625mCeUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:48.903877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05814","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d5dc71b84b658f352be194b3d50734a68d607cba8b94e4deb3540365c58b3f4","sha256:0b554a452140977862d893233c539d6dab60b2deb505f6775ddf23f6cc879c25"],"state_sha256":"4fa42787d9a51deece40d8d7566b5298e75a2ca25415017325c253acd6c765df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ip/adBfeFDuMBxl3dwFFhAnnXWccp+VFwfYIFeTBS6aIIFH0ZElShSTQlhQRw1NXz10oFcrU0cMtaD77DBG2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:20:45.765542Z","bundle_sha256":"4a06c2524c119ffd077f71c1191c13bb344253efccce37473cf7a67059b1eb00"}}