{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HTNPIQQ7SH5XQN7RAD4JKUYFNJ","short_pith_number":"pith:HTNPIQQ7","canonical_record":{"source":{"id":"2010.01878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T09:25:53Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"08622fe3e7ae72feb74f577dd87a1c3031f77e59184697b5d27b3574a8238b5b","abstract_canon_sha256":"07f4f00e0ea3b201422c072033ff178a20603999cd9e3ee631253cdb4bcadf1e"},"schema_version":"1.0"},"canonical_sha256":"3cdaf4421f91fb7837f100f89553056a68db169ec7cac572f3449d745be30f31","source":{"kind":"arxiv","id":"2010.01878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.01878","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"arxiv_version","alias_value":"2010.01878v1","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01878","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"pith_short_12","alias_value":"HTNPIQQ7SH5X","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"pith_short_16","alias_value":"HTNPIQQ7SH5XQN7R","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"pith_short_8","alias_value":"HTNPIQQ7","created_at":"2026-07-05T01:51:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HTNPIQQ7SH5XQN7RAD4JKUYFNJ","target":"record","payload":{"canonical_record":{"source":{"id":"2010.01878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T09:25:53Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"08622fe3e7ae72feb74f577dd87a1c3031f77e59184697b5d27b3574a8238b5b","abstract_canon_sha256":"07f4f00e0ea3b201422c072033ff178a20603999cd9e3ee631253cdb4bcadf1e"},"schema_version":"1.0"},"canonical_sha256":"3cdaf4421f91fb7837f100f89553056a68db169ec7cac572f3449d745be30f31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:09.380900Z","signature_b64":"u01ZdAXgVgg64E9pyV1tWa8FNT7VEoNosFMrU3RGfNeMrdCP2dy5MoKEc3E/3C9gwjF47D6DsSbpgRoj2nF2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cdaf4421f91fb7837f100f89553056a68db169ec7cac572f3449d745be30f31","last_reissued_at":"2026-07-05T01:51:09.380325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:09.380325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.01878","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-07-05T01:51:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wSfvyFokb88+gUZlLHgeC64faWZKcRmFd4gfrPH2Nw8miGl0QmGfORRN5m5WMfD6FbP9UQxDGz3+3rOflFSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T19:54:59.011064Z"},"content_sha256":"114f18a804fde65c4e59d1da585e2c93a06ff6d69467ecb6852085da2861cf61","schema_version":"1.0","event_id":"sha256:114f18a804fde65c4e59d1da585e2c93a06ff6d69467ecb6852085da2861cf61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HTNPIQQ7SH5XQN7RAD4JKUYFNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"\"LazImpa\": Lazy and Impatient neural agents learn to communicate efficiently","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.CL","authors_text":"Emmanuel Dupoux, Mathieu Rita, Rahma Chaabouni","submitted_at":"2020-10-05T09:25:53Z","abstract_excerpt":"Previous work has shown that artificial neural agents naturally develop surprisingly non-efficient codes. This is illustrated by the fact that in a referential game involving a speaker and a listener neural networks optimizing accurate transmission over a discrete channel, the emergent messages fail to achieve an optimal length. Furthermore, frequent messages tend to be longer than infrequent ones, a pattern contrary to the Zipf Law of Abbreviation (ZLA) observed in all natural languages. Here, we show that near-optimal and ZLA-compatible messages can emerge, but only if both the speaker and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01878","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/2010.01878/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"},"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-07-05T01:51:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6z0GXytafrRvsDRCe2vf5tu8V0H16nRQJ6Zi9Lh694FEph+7yhlveaou25JJgy36rNPEGkf2gZj7BRaHQOgDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T19:54:59.011728Z"},"content_sha256":"4c437b2889ff0225179a9d10dac36c85842bf71cb69e35d52981bff84c6f579d","schema_version":"1.0","event_id":"sha256:4c437b2889ff0225179a9d10dac36c85842bf71cb69e35d52981bff84c6f579d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTNPIQQ7SH5XQN7RAD4JKUYFNJ/bundle.json","state_url":"https://pith.science/pith/HTNPIQQ7SH5XQN7RAD4JKUYFNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTNPIQQ7SH5XQN7RAD4JKUYFNJ/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-07-12T19:54:59Z","links":{"resolver":"https://pith.science/pith/HTNPIQQ7SH5XQN7RAD4JKUYFNJ","bundle":"https://pith.science/pith/HTNPIQQ7SH5XQN7RAD4JKUYFNJ/bundle.json","state":"https://pith.science/pith/HTNPIQQ7SH5XQN7RAD4JKUYFNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTNPIQQ7SH5XQN7RAD4JKUYFNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HTNPIQQ7SH5XQN7RAD4JKUYFNJ","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":"07f4f00e0ea3b201422c072033ff178a20603999cd9e3ee631253cdb4bcadf1e","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T09:25:53Z","title_canon_sha256":"08622fe3e7ae72feb74f577dd87a1c3031f77e59184697b5d27b3574a8238b5b"},"schema_version":"1.0","source":{"id":"2010.01878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.01878","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"arxiv_version","alias_value":"2010.01878v1","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01878","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"pith_short_12","alias_value":"HTNPIQQ7SH5X","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"pith_short_16","alias_value":"HTNPIQQ7SH5XQN7R","created_at":"2026-07-05T01:51:09Z"},{"alias_kind":"pith_short_8","alias_value":"HTNPIQQ7","created_at":"2026-07-05T01:51:09Z"}],"graph_snapshots":[{"event_id":"sha256:4c437b2889ff0225179a9d10dac36c85842bf71cb69e35d52981bff84c6f579d","target":"graph","created_at":"2026-07-05T01:51:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.01878/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Previous work has shown that artificial neural agents naturally develop surprisingly non-efficient codes. This is illustrated by the fact that in a referential game involving a speaker and a listener neural networks optimizing accurate transmission over a discrete channel, the emergent messages fail to achieve an optimal length. Furthermore, frequent messages tend to be longer than infrequent ones, a pattern contrary to the Zipf Law of Abbreviation (ZLA) observed in all natural languages. Here, we show that near-optimal and ZLA-compatible messages can emerge, but only if both the speaker and t","authors_text":"Emmanuel Dupoux, Mathieu Rita, Rahma Chaabouni","cross_cats":["cs.AI","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T09:25:53Z","title":"\"LazImpa\": Lazy and Impatient neural agents learn to communicate efficiently"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01878","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:114f18a804fde65c4e59d1da585e2c93a06ff6d69467ecb6852085da2861cf61","target":"record","created_at":"2026-07-05T01:51:09Z","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":"07f4f00e0ea3b201422c072033ff178a20603999cd9e3ee631253cdb4bcadf1e","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T09:25:53Z","title_canon_sha256":"08622fe3e7ae72feb74f577dd87a1c3031f77e59184697b5d27b3574a8238b5b"},"schema_version":"1.0","source":{"id":"2010.01878","kind":"arxiv","version":1}},"canonical_sha256":"3cdaf4421f91fb7837f100f89553056a68db169ec7cac572f3449d745be30f31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cdaf4421f91fb7837f100f89553056a68db169ec7cac572f3449d745be30f31","first_computed_at":"2026-07-05T01:51:09.380325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:09.380325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u01ZdAXgVgg64E9pyV1tWa8FNT7VEoNosFMrU3RGfNeMrdCP2dy5MoKEc3E/3C9gwjF47D6DsSbpgRoj2nF2Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:09.380900Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.01878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:114f18a804fde65c4e59d1da585e2c93a06ff6d69467ecb6852085da2861cf61","sha256:4c437b2889ff0225179a9d10dac36c85842bf71cb69e35d52981bff84c6f579d"],"state_sha256":"1c8b80b3688337ac9e12f8979d7fb0800b1ecb4bd7a2aabcadedbec66d0b9dc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdJUTtW+zKpxIqhFobrJnT7B0gRwA5Ww0KF0pYKSY4eoM0ek6yvwU8FXI1k3Stqo2exfoH0EvFW0oFXBD/qaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T19:54:59.015293Z","bundle_sha256":"488edc694ee11cc79bcc70328737631010a83a4283bfcba64815611dbebd4713"}}