{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JIKX45BC2IFKR54OUE2EINGQPZ","short_pith_number":"pith:JIKX45BC","canonical_record":{"source":{"id":"2605.30546","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-28T20:28:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"405c39ac8b7dd0cafe0530084e87a22e1cd2d408e61e504c5f96da0710b00052","abstract_canon_sha256":"9a7220a82046946b80d18bed12425d0e67a1120115aa50d7378baba3b603772e"},"schema_version":"1.0"},"canonical_sha256":"4a157e7422d20aa8f78ea1344434d07e4dd4bcc29f217e9fc4fd87aa5d986a19","source":{"kind":"arxiv","id":"2605.30546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30546","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30546v1","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30546","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"JIKX45BC2IFK","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"JIKX45BC2IFKR54O","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"JIKX45BC","created_at":"2026-06-01T01:03:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JIKX45BC2IFKR54OUE2EINGQPZ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.30546","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-28T20:28:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"405c39ac8b7dd0cafe0530084e87a22e1cd2d408e61e504c5f96da0710b00052","abstract_canon_sha256":"9a7220a82046946b80d18bed12425d0e67a1120115aa50d7378baba3b603772e"},"schema_version":"1.0"},"canonical_sha256":"4a157e7422d20aa8f78ea1344434d07e4dd4bcc29f217e9fc4fd87aa5d986a19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:00.363113Z","signature_b64":"hGIiI1UZ0+rJz7FJeKMVeK5Gt2v8c5rx1rY5ufUCE7FXBAbUm1BgaVDxbylEiUmAgNF00EUECCMGtGQITsq0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a157e7422d20aa8f78ea1344434d07e4dd4bcc29f217e9fc4fd87aa5d986a19","last_reissued_at":"2026-06-01T01:03:00.362272Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:00.362272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.30546","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-06-01T01:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DMPTFB2uLhsN32QZivD0N7qZbZ0VAQLRjRJJ3X2zSd4n7V/CnOCsgkKaJJvE45yZMQ5x4SVfz5f6CHWmV4cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T04:37:14.864156Z"},"content_sha256":"5e0e0b1eef8e125a70be39c9d5ac3b65db63fb47e82eb47d9f69f35db08de744","schema_version":"1.0","event_id":"sha256:5e0e0b1eef8e125a70be39c9d5ac3b65db63fb47e82eb47d9f69f35db08de744"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JIKX45BC2IFKR54OUE2EINGQPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Yang Ze Guan, Yi-Jun Chang","submitted_at":"2026-05-28T20:28:08Z","abstract_excerpt":"We study the aggregation problem in synchronous multi-hop radio networks with $O(\\log n)$-bit messages and no collision detection. Each node initially holds a value, and the goal is to compute a global aggregate such as the sum of all values. Aggregation tasks arise naturally in wireless sensor networks, where nodes are often battery-powered and radio activity is the dominant source of energy consumption. Accordingly, our main objective is to minimize the energy complexity, defined as the maximum number of rounds in which any node is awake.\n  Our main result is a randomized distributed algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30546","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/2605.30546/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-06-01T01:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0UXoJsm6YloHga071C4xT56EAZVtWlHD4Qk7n08XmIy8Fm3bIpQhA/dON5eON4ZHWWPNOZZh1pbjJLMRqdigBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T04:37:14.864551Z"},"content_sha256":"fbcf10a12e4509a712ddffdddb9f507b4bfbbb815b005bc7cebcb6a169f32d6f","schema_version":"1.0","event_id":"sha256:fbcf10a12e4509a712ddffdddb9f507b4bfbbb815b005bc7cebcb6a169f32d6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIKX45BC2IFKR54OUE2EINGQPZ/bundle.json","state_url":"https://pith.science/pith/JIKX45BC2IFKR54OUE2EINGQPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIKX45BC2IFKR54OUE2EINGQPZ/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-21T04:37:14Z","links":{"resolver":"https://pith.science/pith/JIKX45BC2IFKR54OUE2EINGQPZ","bundle":"https://pith.science/pith/JIKX45BC2IFKR54OUE2EINGQPZ/bundle.json","state":"https://pith.science/pith/JIKX45BC2IFKR54OUE2EINGQPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIKX45BC2IFKR54OUE2EINGQPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JIKX45BC2IFKR54OUE2EINGQPZ","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":"9a7220a82046946b80d18bed12425d0e67a1120115aa50d7378baba3b603772e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-28T20:28:08Z","title_canon_sha256":"405c39ac8b7dd0cafe0530084e87a22e1cd2d408e61e504c5f96da0710b00052"},"schema_version":"1.0","source":{"id":"2605.30546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30546","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30546v1","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30546","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"JIKX45BC2IFK","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"JIKX45BC2IFKR54O","created_at":"2026-06-01T01:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"JIKX45BC","created_at":"2026-06-01T01:03:00Z"}],"graph_snapshots":[{"event_id":"sha256:fbcf10a12e4509a712ddffdddb9f507b4bfbbb815b005bc7cebcb6a169f32d6f","target":"graph","created_at":"2026-06-01T01:03:00Z","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/2605.30546/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the aggregation problem in synchronous multi-hop radio networks with $O(\\log n)$-bit messages and no collision detection. Each node initially holds a value, and the goal is to compute a global aggregate such as the sum of all values. Aggregation tasks arise naturally in wireless sensor networks, where nodes are often battery-powered and radio activity is the dominant source of energy consumption. Accordingly, our main objective is to minimize the energy complexity, defined as the maximum number of rounds in which any node is awake.\n  Our main result is a randomized distributed algorit","authors_text":"Yang Ze Guan, Yi-Jun Chang","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-28T20:28:08Z","title":"Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30546","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:5e0e0b1eef8e125a70be39c9d5ac3b65db63fb47e82eb47d9f69f35db08de744","target":"record","created_at":"2026-06-01T01:03:00Z","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":"9a7220a82046946b80d18bed12425d0e67a1120115aa50d7378baba3b603772e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-28T20:28:08Z","title_canon_sha256":"405c39ac8b7dd0cafe0530084e87a22e1cd2d408e61e504c5f96da0710b00052"},"schema_version":"1.0","source":{"id":"2605.30546","kind":"arxiv","version":1}},"canonical_sha256":"4a157e7422d20aa8f78ea1344434d07e4dd4bcc29f217e9fc4fd87aa5d986a19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a157e7422d20aa8f78ea1344434d07e4dd4bcc29f217e9fc4fd87aa5d986a19","first_computed_at":"2026-06-01T01:03:00.362272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:00.362272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hGIiI1UZ0+rJz7FJeKMVeK5Gt2v8c5rx1rY5ufUCE7FXBAbUm1BgaVDxbylEiUmAgNF00EUECCMGtGQITsq0Bg==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:00.363113Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.30546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e0e0b1eef8e125a70be39c9d5ac3b65db63fb47e82eb47d9f69f35db08de744","sha256:fbcf10a12e4509a712ddffdddb9f507b4bfbbb815b005bc7cebcb6a169f32d6f"],"state_sha256":"6eb6a2fe9755e28162d5aa454f8355b178e2c2b384c6f87cd826f7bf1cc73a0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBtIpAG+qj+hwuyRy+W8L+V8tHoEYg1z8ati4cYIQjOtO5D3uQZQTTbwb7Su916LKOj+qTtLqfVxghUJRWQhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T04:37:14.866586Z","bundle_sha256":"47eae626b8f54a022228da7b21dcbd16069c7acf18e44c2225f127fdf4ef1dcb"}}