{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OTSYWRBVR6FUPDBQ7LAEGRDI2V","short_pith_number":"pith:OTSYWRBV","schema_version":"1.0","canonical_sha256":"74e58b44358f8b478c30fac0434468d5463442e12cf939123df5948454968b40","source":{"kind":"arxiv","id":"1812.05717","version":2},"attestation_state":"computed","paper":{"title":"Network Coding with Random Packet-Index Assignment for Data Collection Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"C\\'edric Adjih, Claudio Greco, Michel Kieffer","submitted_at":"2018-12-13T22:39:47Z","abstract_excerpt":"This paper considers a data collection network consisting of uncoordinated, heterogeneous, and possibly mobile devices. These devices use medium and short-range radio technologies, which require multi-hop communication to deliver data to some sink. While numerous techniques from managed networks can be adapted, one of the most efficient (from the energy and spectrum use perspective) is \\emph{network coding} (NC). NC is well suited to networks with mobility and unreliability, however, practical NC requires a precise identification of individual packets that have been mixed together. In a purely"},"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":"1812.05717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-13T22:39:47Z","cross_cats_sorted":[],"title_canon_sha256":"980ff5a45c1b62ffe1c5b8f86d1322ec33ec37a111155195ea13c60ed9586cf7","abstract_canon_sha256":"6ca72aa7de482914cb9727d66ccca0360f01945f6bc139e5dcee6e58bca0f0e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:19.042923Z","signature_b64":"VdecS4NO2bO6kJF8P6JA6fiKHx9iQpJstwzw1qvUfGfM7Esae5WKWSZi99hUUYbbJN3dvi50q/pidu0yyqe+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74e58b44358f8b478c30fac0434468d5463442e12cf939123df5948454968b40","last_reissued_at":"2026-05-17T23:57:19.042329Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:19.042329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Coding with Random Packet-Index Assignment for Data Collection Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"C\\'edric Adjih, Claudio Greco, Michel Kieffer","submitted_at":"2018-12-13T22:39:47Z","abstract_excerpt":"This paper considers a data collection network consisting of uncoordinated, heterogeneous, and possibly mobile devices. These devices use medium and short-range radio technologies, which require multi-hop communication to deliver data to some sink. While numerous techniques from managed networks can be adapted, one of the most efficient (from the energy and spectrum use perspective) is \\emph{network coding} (NC). NC is well suited to networks with mobility and unreliability, however, practical NC requires a precise identification of individual packets that have been mixed together. In a purely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05717","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":"1812.05717","created_at":"2026-05-17T23:57:19.042424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05717v2","created_at":"2026-05-17T23:57:19.042424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05717","created_at":"2026-05-17T23:57:19.042424+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTSYWRBVR6FU","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTSYWRBVR6FUPDBQ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTSYWRBV","created_at":"2026-05-18T12:32:43.782077+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/OTSYWRBVR6FUPDBQ7LAEGRDI2V","json":"https://pith.science/pith/OTSYWRBVR6FUPDBQ7LAEGRDI2V.json","graph_json":"https://pith.science/api/pith-number/OTSYWRBVR6FUPDBQ7LAEGRDI2V/graph.json","events_json":"https://pith.science/api/pith-number/OTSYWRBVR6FUPDBQ7LAEGRDI2V/events.json","paper":"https://pith.science/paper/OTSYWRBV"},"agent_actions":{"view_html":"https://pith.science/pith/OTSYWRBVR6FUPDBQ7LAEGRDI2V","download_json":"https://pith.science/pith/OTSYWRBVR6FUPDBQ7LAEGRDI2V.json","view_paper":"https://pith.science/paper/OTSYWRBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05717&json=true","fetch_graph":"https://pith.science/api/pith-number/OTSYWRBVR6FUPDBQ7LAEGRDI2V/graph.json","fetch_events":"https://pith.science/api/pith-number/OTSYWRBVR6FUPDBQ7LAEGRDI2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTSYWRBVR6FUPDBQ7LAEGRDI2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTSYWRBVR6FUPDBQ7LAEGRDI2V/action/storage_attestation","attest_author":"https://pith.science/pith/OTSYWRBVR6FUPDBQ7LAEGRDI2V/action/author_attestation","sign_citation":"https://pith.science/pith/OTSYWRBVR6FUPDBQ7LAEGRDI2V/action/citation_signature","submit_replication":"https://pith.science/pith/OTSYWRBVR6FUPDBQ7LAEGRDI2V/action/replication_record"}},"created_at":"2026-05-17T23:57:19.042424+00:00","updated_at":"2026-05-17T23:57:19.042424+00:00"}