{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TXNFLS7SUE6RXHEOCDVM66TBUY","short_pith_number":"pith:TXNFLS7S","schema_version":"1.0","canonical_sha256":"9dda55cbf2a13d1b9c8e10eacf7a61a600c91c522f07cab2665ac2afe01d7008","source":{"kind":"arxiv","id":"1504.04244","version":2},"attestation_state":"computed","paper":{"title":"Throughput Maximization in Multi-Hop Wireless Networks under Secrecy Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlos H. M. de Lima, Hirley Alves, Matti Latva-aho, Pedro H. J. Nardelli","submitted_at":"2015-04-16T14:12:54Z","abstract_excerpt":"This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node and then sent to the control unit. The sensor measurements, their communication with the aggregetor and the information processing are all assumed perfect. To reach the control unit, the message may travel through relay nodes, forming a multi-hop, wireless link. At every hop, eavesdropper nodes attempt to acquire the messages transmitted through the legitima"},"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":"1504.04244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-16T14:12:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a8fa49eaa6ab0515f98b618100a8cdbc981ac081ccf8554b776b95b235d837a2","abstract_canon_sha256":"8f5420d8901e81a95301b13f8d14a16a76edf9a9da8dd01c4f9f2af39228fa87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:10.885223Z","signature_b64":"re4/T+Zftw8WgEQG6qEc6YLfBQ3hASq3N2/gAHS0y4SBaaPPU7Y2WUZ9ojbtxZWs9ybR0UjLEqNIGIY6YEqBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dda55cbf2a13d1b9c8e10eacf7a61a600c91c522f07cab2665ac2afe01d7008","last_reissued_at":"2026-05-18T01:24:10.884734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:10.884734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput Maximization in Multi-Hop Wireless Networks under Secrecy Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlos H. M. de Lima, Hirley Alves, Matti Latva-aho, Pedro H. J. Nardelli","submitted_at":"2015-04-16T14:12:54Z","abstract_excerpt":"This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node and then sent to the control unit. The sensor measurements, their communication with the aggregetor and the information processing are all assumed perfect. To reach the control unit, the message may travel through relay nodes, forming a multi-hop, wireless link. At every hop, eavesdropper nodes attempt to acquire the messages transmitted through the legitima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04244","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":"1504.04244","created_at":"2026-05-18T01:24:10.884823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04244v2","created_at":"2026-05-18T01:24:10.884823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04244","created_at":"2026-05-18T01:24:10.884823+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXNFLS7SUE6R","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXNFLS7SUE6RXHEO","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXNFLS7S","created_at":"2026-05-18T12:29:42.218222+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/TXNFLS7SUE6RXHEOCDVM66TBUY","json":"https://pith.science/pith/TXNFLS7SUE6RXHEOCDVM66TBUY.json","graph_json":"https://pith.science/api/pith-number/TXNFLS7SUE6RXHEOCDVM66TBUY/graph.json","events_json":"https://pith.science/api/pith-number/TXNFLS7SUE6RXHEOCDVM66TBUY/events.json","paper":"https://pith.science/paper/TXNFLS7S"},"agent_actions":{"view_html":"https://pith.science/pith/TXNFLS7SUE6RXHEOCDVM66TBUY","download_json":"https://pith.science/pith/TXNFLS7SUE6RXHEOCDVM66TBUY.json","view_paper":"https://pith.science/paper/TXNFLS7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04244&json=true","fetch_graph":"https://pith.science/api/pith-number/TXNFLS7SUE6RXHEOCDVM66TBUY/graph.json","fetch_events":"https://pith.science/api/pith-number/TXNFLS7SUE6RXHEOCDVM66TBUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXNFLS7SUE6RXHEOCDVM66TBUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXNFLS7SUE6RXHEOCDVM66TBUY/action/storage_attestation","attest_author":"https://pith.science/pith/TXNFLS7SUE6RXHEOCDVM66TBUY/action/author_attestation","sign_citation":"https://pith.science/pith/TXNFLS7SUE6RXHEOCDVM66TBUY/action/citation_signature","submit_replication":"https://pith.science/pith/TXNFLS7SUE6RXHEOCDVM66TBUY/action/replication_record"}},"created_at":"2026-05-18T01:24:10.884823+00:00","updated_at":"2026-05-18T01:24:10.884823+00:00"}