{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3TV6J4X7XU237CWTKXZPOBKSBD","short_pith_number":"pith:3TV6J4X7","canonical_record":{"source":{"id":"2512.02634","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-02T10:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"058a55407cdf8746b271df1f53e95b9ee769051a83ed151edbd87bfeb703ee82","abstract_canon_sha256":"f530345878eef6cb872b16a11383f4c4db4b612895cd9a8f5450aed2c075cf84"},"schema_version":"1.0"},"canonical_sha256":"dcebe4f2ffbd35bf8ad355f2f7055208f3bfd0c0655a9231262c977beb3a1867","source":{"kind":"arxiv","id":"2512.02634","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.02634","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"2512.02634v4","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.02634","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"3TV6J4X7XU23","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"pith_short_16","alias_value":"3TV6J4X7XU237CWT","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"pith_short_8","alias_value":"3TV6J4X7","created_at":"2026-05-26T02:05:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3TV6J4X7XU237CWTKXZPOBKSBD","target":"record","payload":{"canonical_record":{"source":{"id":"2512.02634","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-02T10:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"058a55407cdf8746b271df1f53e95b9ee769051a83ed151edbd87bfeb703ee82","abstract_canon_sha256":"f530345878eef6cb872b16a11383f4c4db4b612895cd9a8f5450aed2c075cf84"},"schema_version":"1.0"},"canonical_sha256":"dcebe4f2ffbd35bf8ad355f2f7055208f3bfd0c0655a9231262c977beb3a1867","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:04.349106Z","signature_b64":"bA0kQDv8lryFm3clduVcKSGGX4A5ZiHxKkfwnqVSewcQYsHm2xSs+Rxr/Ni3hqu2K1r9bTmGeGoYIal7+t3VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcebe4f2ffbd35bf8ad355f2f7055208f3bfd0c0655a9231262c977beb3a1867","last_reissued_at":"2026-05-26T02:05:04.347907Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:04.347907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.02634","source_version":4,"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-05-26T02:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bw3F2ZvDuOL9Mbxt/ZEAHKa38n6RMKzt222yG0cpC7av8LpqawSksZWoQRbtzWJGjuGiEw2ZT03+Tao8I2H0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:42:55.778256Z"},"content_sha256":"5f8f6ce6177403f0e39d287b24597c1386ab89ee689b7829c566b16ca4ef723b","schema_version":"1.0","event_id":"sha256:5f8f6ce6177403f0e39d287b24597c1386ab89ee689b7829c566b16ca4ef723b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3TV6J4X7XU237CWTKXZPOBKSBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Communication-Efficient Distributed Optimization Algorithm for Problems with Coupling Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shanying Zhu, Xiaoming Duan, Yuzhu Duan, Ziwen Yang","submitted_at":"2025-12-02T10:46:29Z","abstract_excerpt":"Resource allocation is a fundamental problem in Industrial Internet of Things (IIoT) systems, in which devices work together under limited communication bandwidth to complete diverse tasks. This paper proposes a communication-efficient distributed optimization algorithm tailored for problems with coupled constraints. To tackle coupled constraints, we solve the problem via its dual counterpart, and develop a compressed version. Difference compression and dynamic scaling factors are then introduced to mitigate compression errors. We show that the proposed algorithm converges linearly for strongl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.02634","kind":"arxiv","version":4},"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/2512.02634/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-05-26T02:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGHlkehRKZAD40/ejYfFsTldjQtRt0YLMKrGqOxdK80JhiCnHlfYXsAXuI7hNrHCGB7qzdF/mhmc3QHg3opOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:42:55.779044Z"},"content_sha256":"8bad8fa6b70229c845e60c5b8385679f51fa9f24cbdb5378d2e88cbf64cbbf75","schema_version":"1.0","event_id":"sha256:8bad8fa6b70229c845e60c5b8385679f51fa9f24cbdb5378d2e88cbf64cbbf75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TV6J4X7XU237CWTKXZPOBKSBD/bundle.json","state_url":"https://pith.science/pith/3TV6J4X7XU237CWTKXZPOBKSBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TV6J4X7XU237CWTKXZPOBKSBD/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-06T06:42:55Z","links":{"resolver":"https://pith.science/pith/3TV6J4X7XU237CWTKXZPOBKSBD","bundle":"https://pith.science/pith/3TV6J4X7XU237CWTKXZPOBKSBD/bundle.json","state":"https://pith.science/pith/3TV6J4X7XU237CWTKXZPOBKSBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TV6J4X7XU237CWTKXZPOBKSBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3TV6J4X7XU237CWTKXZPOBKSBD","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":"f530345878eef6cb872b16a11383f4c4db4b612895cd9a8f5450aed2c075cf84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-02T10:46:29Z","title_canon_sha256":"058a55407cdf8746b271df1f53e95b9ee769051a83ed151edbd87bfeb703ee82"},"schema_version":"1.0","source":{"id":"2512.02634","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.02634","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"2512.02634v4","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.02634","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"3TV6J4X7XU23","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"pith_short_16","alias_value":"3TV6J4X7XU237CWT","created_at":"2026-05-26T02:05:04Z"},{"alias_kind":"pith_short_8","alias_value":"3TV6J4X7","created_at":"2026-05-26T02:05:04Z"}],"graph_snapshots":[{"event_id":"sha256:8bad8fa6b70229c845e60c5b8385679f51fa9f24cbdb5378d2e88cbf64cbbf75","target":"graph","created_at":"2026-05-26T02:05:04Z","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/2512.02634/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Resource allocation is a fundamental problem in Industrial Internet of Things (IIoT) systems, in which devices work together under limited communication bandwidth to complete diverse tasks. This paper proposes a communication-efficient distributed optimization algorithm tailored for problems with coupled constraints. To tackle coupled constraints, we solve the problem via its dual counterpart, and develop a compressed version. Difference compression and dynamic scaling factors are then introduced to mitigate compression errors. We show that the proposed algorithm converges linearly for strongl","authors_text":"Shanying Zhu, Xiaoming Duan, Yuzhu Duan, Ziwen Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-02T10:46:29Z","title":"A Communication-Efficient Distributed Optimization Algorithm for Problems with Coupling Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.02634","kind":"arxiv","version":4},"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:5f8f6ce6177403f0e39d287b24597c1386ab89ee689b7829c566b16ca4ef723b","target":"record","created_at":"2026-05-26T02:05:04Z","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":"f530345878eef6cb872b16a11383f4c4db4b612895cd9a8f5450aed2c075cf84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-02T10:46:29Z","title_canon_sha256":"058a55407cdf8746b271df1f53e95b9ee769051a83ed151edbd87bfeb703ee82"},"schema_version":"1.0","source":{"id":"2512.02634","kind":"arxiv","version":4}},"canonical_sha256":"dcebe4f2ffbd35bf8ad355f2f7055208f3bfd0c0655a9231262c977beb3a1867","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcebe4f2ffbd35bf8ad355f2f7055208f3bfd0c0655a9231262c977beb3a1867","first_computed_at":"2026-05-26T02:05:04.347907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:05:04.347907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bA0kQDv8lryFm3clduVcKSGGX4A5ZiHxKkfwnqVSewcQYsHm2xSs+Rxr/Ni3hqu2K1r9bTmGeGoYIal7+t3VAg==","signature_status":"signed_v1","signed_at":"2026-05-26T02:05:04.349106Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.02634","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f8f6ce6177403f0e39d287b24597c1386ab89ee689b7829c566b16ca4ef723b","sha256:8bad8fa6b70229c845e60c5b8385679f51fa9f24cbdb5378d2e88cbf64cbbf75"],"state_sha256":"8eccd1ed96e57e99f32a0b5ed978f5fbd4b24f0f9659f9e514da689d91670557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gzm4Z6eL8Yaa5PgeA2DgjVso0VD5k6mMBC4ahWOdV4jciaiDgSciTrgfWOT5BuwZ2dknsfpBRkGyZ9nYSvghAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:42:55.783788Z","bundle_sha256":"8b66ea6c5a5219913f43713cdddfd179b438a9f378f87275df37bafb005b11ef"}}