{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ROS7ABQJIJCMVXUYJVCV7JICUS","short_pith_number":"pith:ROS7ABQJ","schema_version":"1.0","canonical_sha256":"8ba5f006094244cade984d455fa502a49c062d22266594049acf45527a3437b5","source":{"kind":"arxiv","id":"1804.01773","version":1},"attestation_state":"computed","paper":{"title":"Distributed Data Compression in Sensor Clusters: A Maximum Independent Flow Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Smith, Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo","submitted_at":"2018-04-05T10:50:09Z","abstract_excerpt":"Let a cluster (network) of sensors be connected by the communication links, each link having a capacity upper bound. Each sensor observes a discrete random variable in private and one sensor serves as a cluster header or sink. Here, we formulate the problem of how to let the sensors encode their observations such that the direction of compressed data is a feasible flow towards the sink. We demonstrate that this problem can be solved by an existing maximum independent flow (MIF) algorithm in polynomial time. Further, we reveal that this algorithm in fact determines an optimal solution by recurs"},"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":"1804.01773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-05T10:50:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cdf40949893185699fd5438000df6f4f1ad2803be861736d71fd2aeadb6479d8","abstract_canon_sha256":"a2fec0f3b39fe009972f06e834e26feb552ea6265b77a84b5847f74af4ff196f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:10.017852Z","signature_b64":"KCMRvaBxuxAcysSPxKHeCoks40KbWuN3VEuLwc7/1qs2HZcvq4hhqiZ+G/0FdF958An62AcyCZG22OH90+BnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ba5f006094244cade984d455fa502a49c062d22266594049acf45527a3437b5","last_reissued_at":"2026-05-18T00:19:10.017258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:10.017258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Data Compression in Sensor Clusters: A Maximum Independent Flow Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Smith, Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo","submitted_at":"2018-04-05T10:50:09Z","abstract_excerpt":"Let a cluster (network) of sensors be connected by the communication links, each link having a capacity upper bound. Each sensor observes a discrete random variable in private and one sensor serves as a cluster header or sink. Here, we formulate the problem of how to let the sensors encode their observations such that the direction of compressed data is a feasible flow towards the sink. We demonstrate that this problem can be solved by an existing maximum independent flow (MIF) algorithm in polynomial time. Further, we reveal that this algorithm in fact determines an optimal solution by recurs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01773","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":"1804.01773","created_at":"2026-05-18T00:19:10.017358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01773v1","created_at":"2026-05-18T00:19:10.017358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01773","created_at":"2026-05-18T00:19:10.017358+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROS7ABQJIJCM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROS7ABQJIJCMVXUY","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROS7ABQJ","created_at":"2026-05-18T12:32:50.500415+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/ROS7ABQJIJCMVXUYJVCV7JICUS","json":"https://pith.science/pith/ROS7ABQJIJCMVXUYJVCV7JICUS.json","graph_json":"https://pith.science/api/pith-number/ROS7ABQJIJCMVXUYJVCV7JICUS/graph.json","events_json":"https://pith.science/api/pith-number/ROS7ABQJIJCMVXUYJVCV7JICUS/events.json","paper":"https://pith.science/paper/ROS7ABQJ"},"agent_actions":{"view_html":"https://pith.science/pith/ROS7ABQJIJCMVXUYJVCV7JICUS","download_json":"https://pith.science/pith/ROS7ABQJIJCMVXUYJVCV7JICUS.json","view_paper":"https://pith.science/paper/ROS7ABQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01773&json=true","fetch_graph":"https://pith.science/api/pith-number/ROS7ABQJIJCMVXUYJVCV7JICUS/graph.json","fetch_events":"https://pith.science/api/pith-number/ROS7ABQJIJCMVXUYJVCV7JICUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROS7ABQJIJCMVXUYJVCV7JICUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROS7ABQJIJCMVXUYJVCV7JICUS/action/storage_attestation","attest_author":"https://pith.science/pith/ROS7ABQJIJCMVXUYJVCV7JICUS/action/author_attestation","sign_citation":"https://pith.science/pith/ROS7ABQJIJCMVXUYJVCV7JICUS/action/citation_signature","submit_replication":"https://pith.science/pith/ROS7ABQJIJCMVXUYJVCV7JICUS/action/replication_record"}},"created_at":"2026-05-18T00:19:10.017358+00:00","updated_at":"2026-05-18T00:19:10.017358+00:00"}