{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ISX3X5BW3TWB7OFSBMERJBQTQ2","short_pith_number":"pith:ISX3X5BW","canonical_record":{"source":{"id":"1704.06684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-21T19:14:05Z","cross_cats_sorted":["cs.DS","cs.NE","cs.NI"],"title_canon_sha256":"e14c6990c87d2f607ad85d5671e031f32f320fc5f7e5798a85140d86201ef044","abstract_canon_sha256":"3f4aa20b0f3c1f2c4a9864b771a137d462031a173834167d3070ec162deb491f"},"schema_version":"1.0"},"canonical_sha256":"44afbbf436dcec1fb8b20b091486138680ddc9962c89d6b36f0f67ce561c171c","source":{"kind":"arxiv","id":"1704.06684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06684","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06684v1","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06684","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"ISX3X5BW3TWB","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ISX3X5BW3TWB7OFS","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ISX3X5BW","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ISX3X5BW3TWB7OFSBMERJBQTQ2","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-21T19:14:05Z","cross_cats_sorted":["cs.DS","cs.NE","cs.NI"],"title_canon_sha256":"e14c6990c87d2f607ad85d5671e031f32f320fc5f7e5798a85140d86201ef044","abstract_canon_sha256":"3f4aa20b0f3c1f2c4a9864b771a137d462031a173834167d3070ec162deb491f"},"schema_version":"1.0"},"canonical_sha256":"44afbbf436dcec1fb8b20b091486138680ddc9962c89d6b36f0f67ce561c171c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:57.906517Z","signature_b64":"mDLk0BWQwqmAUhhskPq6yam10PeWxOYkctJX+spr3PTT9fShzfn+SPA4VJy6Ma9oDet/E4gTthwF4ggoy2eSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44afbbf436dcec1fb8b20b091486138680ddc9962c89d6b36f0f67ce561c171c","last_reissued_at":"2026-05-18T00:45:57.905891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:57.905891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06684","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-05-18T00:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKCP32lcm5hjVXsXNQ9xtOfnICIeEpobEt6opRaNuLOeXCOBRCys1OQELb70Qgd+3oIPPvA6siMRMP1VMZLlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:48:39.843491Z"},"content_sha256":"6dd309f95746f639aeebcee0f777ed7f15b6bb990c7e5607e9c4c31e2d0a4e32","schema_version":"1.0","event_id":"sha256:6dd309f95746f639aeebcee0f777ed7f15b6bb990c7e5607e9c4c31e2d0a4e32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ISX3X5BW3TWB7OFSBMERJBQTQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A hybrid exact-ACO algorithm for the joint scheduling, power and cluster assignment in cooperative wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NE","cs.NI"],"primary_cat":"math.OC","authors_text":"Fabio D'Andreagiovanni","submitted_at":"2017-04-21T19:14:05Z","abstract_excerpt":"Base station cooperation (BSC) has recently arisen as a promising way to increase the capacity of a wireless network. Implementing BSC adds a new design dimension to the classical wireless network design problem: how to define the subset of base stations (clusters) that coordinate to serve a user. Though the problem of forming clusters has been extensively discussed from a technical point of view, there is still a lack of effective optimization models for its representation and algorithms for its solution. In this work, we make a further step towards filling such gap: 1) we generalize the clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06684","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"},"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-18T00:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ssZF3CwwoqAkqyeR+NfhK7f7RMMyi8ft8uWSv03IJcyzx/iRJFz/tN5jeUozLd7vOETpbPeXUPz8KfPxW1byCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:48:39.843861Z"},"content_sha256":"80ef7c367944af27e8a39398ca62952ad60de20b14f1a31280b9eb50ed2ed74e","schema_version":"1.0","event_id":"sha256:80ef7c367944af27e8a39398ca62952ad60de20b14f1a31280b9eb50ed2ed74e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISX3X5BW3TWB7OFSBMERJBQTQ2/bundle.json","state_url":"https://pith.science/pith/ISX3X5BW3TWB7OFSBMERJBQTQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISX3X5BW3TWB7OFSBMERJBQTQ2/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-08T23:48:39Z","links":{"resolver":"https://pith.science/pith/ISX3X5BW3TWB7OFSBMERJBQTQ2","bundle":"https://pith.science/pith/ISX3X5BW3TWB7OFSBMERJBQTQ2/bundle.json","state":"https://pith.science/pith/ISX3X5BW3TWB7OFSBMERJBQTQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISX3X5BW3TWB7OFSBMERJBQTQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ISX3X5BW3TWB7OFSBMERJBQTQ2","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":"3f4aa20b0f3c1f2c4a9864b771a137d462031a173834167d3070ec162deb491f","cross_cats_sorted":["cs.DS","cs.NE","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-21T19:14:05Z","title_canon_sha256":"e14c6990c87d2f607ad85d5671e031f32f320fc5f7e5798a85140d86201ef044"},"schema_version":"1.0","source":{"id":"1704.06684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06684","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06684v1","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06684","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"ISX3X5BW3TWB","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ISX3X5BW3TWB7OFS","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ISX3X5BW","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:80ef7c367944af27e8a39398ca62952ad60de20b14f1a31280b9eb50ed2ed74e","target":"graph","created_at":"2026-05-18T00:45:57Z","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"},"paper":{"abstract_excerpt":"Base station cooperation (BSC) has recently arisen as a promising way to increase the capacity of a wireless network. Implementing BSC adds a new design dimension to the classical wireless network design problem: how to define the subset of base stations (clusters) that coordinate to serve a user. Though the problem of forming clusters has been extensively discussed from a technical point of view, there is still a lack of effective optimization models for its representation and algorithms for its solution. In this work, we make a further step towards filling such gap: 1) we generalize the clas","authors_text":"Fabio D'Andreagiovanni","cross_cats":["cs.DS","cs.NE","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-21T19:14:05Z","title":"A hybrid exact-ACO algorithm for the joint scheduling, power and cluster assignment in cooperative wireless networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06684","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:6dd309f95746f639aeebcee0f777ed7f15b6bb990c7e5607e9c4c31e2d0a4e32","target":"record","created_at":"2026-05-18T00:45:57Z","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":"3f4aa20b0f3c1f2c4a9864b771a137d462031a173834167d3070ec162deb491f","cross_cats_sorted":["cs.DS","cs.NE","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-21T19:14:05Z","title_canon_sha256":"e14c6990c87d2f607ad85d5671e031f32f320fc5f7e5798a85140d86201ef044"},"schema_version":"1.0","source":{"id":"1704.06684","kind":"arxiv","version":1}},"canonical_sha256":"44afbbf436dcec1fb8b20b091486138680ddc9962c89d6b36f0f67ce561c171c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44afbbf436dcec1fb8b20b091486138680ddc9962c89d6b36f0f67ce561c171c","first_computed_at":"2026-05-18T00:45:57.905891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:57.905891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDLk0BWQwqmAUhhskPq6yam10PeWxOYkctJX+spr3PTT9fShzfn+SPA4VJy6Ma9oDet/E4gTthwF4ggoy2eSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:57.906517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6dd309f95746f639aeebcee0f777ed7f15b6bb990c7e5607e9c4c31e2d0a4e32","sha256:80ef7c367944af27e8a39398ca62952ad60de20b14f1a31280b9eb50ed2ed74e"],"state_sha256":"d1b3f5724761626a8c391612ef4e5975676aff99240b59e4788d2d7fe712ad23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8gGZ4dpJYYPR+gdzBY8tch8Czl6iZAEoa/cJb5jOTnZnbV6I77PZ6YOHzzpbrT7Et7So2Kytsn+JIRvXeKQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:48:39.845808Z","bundle_sha256":"bc06338d3b986829ea201d9c14b9ec465f3618ad888a30ff4b5ad583a6b8ba01"}}