{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VFVZMKQFLAMDAI3XGV35H5TGZ5","short_pith_number":"pith:VFVZMKQF","canonical_record":{"source":{"id":"1302.3146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T15:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"95e5ae281df21942c1080fb16927c072a315e42ddfe3af2dec6c86d8c706311b","abstract_canon_sha256":"073e3d9fff3453da7fed017adbe4e3efb6f6abbc060e9d943c177668b14010ca"},"schema_version":"1.0"},"canonical_sha256":"a96b962a0558183023773577d3f666cf47e1e0cce5ce0ae8247948812d268189","source":{"kind":"arxiv","id":"1302.3146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3146","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3146v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3146","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"VFVZMKQFLAMD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VFVZMKQFLAMDAI3X","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VFVZMKQF","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VFVZMKQFLAMDAI3XGV35H5TGZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T15:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"95e5ae281df21942c1080fb16927c072a315e42ddfe3af2dec6c86d8c706311b","abstract_canon_sha256":"073e3d9fff3453da7fed017adbe4e3efb6f6abbc060e9d943c177668b14010ca"},"schema_version":"1.0"},"canonical_sha256":"a96b962a0558183023773577d3f666cf47e1e0cce5ce0ae8247948812d268189","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.445502Z","signature_b64":"6f4HafrWWC3+2Ha+SFY6JH5fkGEfcCeWK807P/lipbsIPr02M4KTN7phgw2Ej80PPf4zx2EmmXz0zmTXQHXbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a96b962a0558183023773577d3f666cf47e1e0cce5ce0ae8247948812d268189","last_reissued_at":"2026-05-18T00:59:04.444934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.444934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3146","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:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wyWLQ5I3LLLWbRQKckEvWtKrvIf6dVRQI5b+bPlDc33JiA2grba013fJcZoWhLabi4vQqfDATE21w1hd3iZvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:49:26.758868Z"},"content_sha256":"1a75293a92a80c9d6a3a69b0cd6b1ca18d1cfb9e2bb1339bc9b2d965ddc43970","schema_version":"1.0","event_id":"sha256:1a75293a92a80c9d6a3a69b0cd6b1ca18d1cfb9e2bb1339bc9b2d965ddc43970"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VFVZMKQFLAMDAI3XGV35H5TGZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Johan A. K. Suykens, Marc Moonen, Paschalis Tsiaflakis","submitted_at":"2013-02-13T15:49:35Z","abstract_excerpt":"Dynamic spectrum management (DSM) has been recognized as a key technology to significantly improve the performance of digital subscriber line (DSL) broadband access networks. The basic concept of DSM is to coordinate transmission over multiple DSL lines so as to mitigate the impact of crosstalk interference amongst them. Many algorithms have been proposed to tackle the nonconvex optimization problems appearing in DSM, almost all of them relying on a standard subgradient based dual decomposition approach. In practice however, this approach is often found to lead to extremely slow convergence or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3146","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:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ikhfmUip6MaFXZLHbA2kKe70BETsV/8sXcbc/ifj1xbWQTJFigdUBDBjKuxpmROSe+dnZHCLJLJafRaGEkYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:49:26.759270Z"},"content_sha256":"8a3951a57742282f2e1a6c7792cbc9860f6a93579f41d401378d1885768002ce","schema_version":"1.0","event_id":"sha256:8a3951a57742282f2e1a6c7792cbc9860f6a93579f41d401378d1885768002ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFVZMKQFLAMDAI3XGV35H5TGZ5/bundle.json","state_url":"https://pith.science/pith/VFVZMKQFLAMDAI3XGV35H5TGZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFVZMKQFLAMDAI3XGV35H5TGZ5/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-05-26T08:49:26Z","links":{"resolver":"https://pith.science/pith/VFVZMKQFLAMDAI3XGV35H5TGZ5","bundle":"https://pith.science/pith/VFVZMKQFLAMDAI3XGV35H5TGZ5/bundle.json","state":"https://pith.science/pith/VFVZMKQFLAMDAI3XGV35H5TGZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFVZMKQFLAMDAI3XGV35H5TGZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VFVZMKQFLAMDAI3XGV35H5TGZ5","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":"073e3d9fff3453da7fed017adbe4e3efb6f6abbc060e9d943c177668b14010ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T15:49:35Z","title_canon_sha256":"95e5ae281df21942c1080fb16927c072a315e42ddfe3af2dec6c86d8c706311b"},"schema_version":"1.0","source":{"id":"1302.3146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3146","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3146v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3146","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"VFVZMKQFLAMD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VFVZMKQFLAMDAI3X","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VFVZMKQF","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:8a3951a57742282f2e1a6c7792cbc9860f6a93579f41d401378d1885768002ce","target":"graph","created_at":"2026-05-18T00:59: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"},"paper":{"abstract_excerpt":"Dynamic spectrum management (DSM) has been recognized as a key technology to significantly improve the performance of digital subscriber line (DSL) broadband access networks. The basic concept of DSM is to coordinate transmission over multiple DSL lines so as to mitigate the impact of crosstalk interference amongst them. Many algorithms have been proposed to tackle the nonconvex optimization problems appearing in DSM, almost all of them relying on a standard subgradient based dual decomposition approach. In practice however, this approach is often found to lead to extremely slow convergence or","authors_text":"Ion Necoara, Johan A. K. Suykens, Marc Moonen, Paschalis Tsiaflakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T15:49:35Z","title":"Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3146","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:1a75293a92a80c9d6a3a69b0cd6b1ca18d1cfb9e2bb1339bc9b2d965ddc43970","target":"record","created_at":"2026-05-18T00:59: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":"073e3d9fff3453da7fed017adbe4e3efb6f6abbc060e9d943c177668b14010ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T15:49:35Z","title_canon_sha256":"95e5ae281df21942c1080fb16927c072a315e42ddfe3af2dec6c86d8c706311b"},"schema_version":"1.0","source":{"id":"1302.3146","kind":"arxiv","version":1}},"canonical_sha256":"a96b962a0558183023773577d3f666cf47e1e0cce5ce0ae8247948812d268189","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a96b962a0558183023773577d3f666cf47e1e0cce5ce0ae8247948812d268189","first_computed_at":"2026-05-18T00:59:04.444934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.444934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6f4HafrWWC3+2Ha+SFY6JH5fkGEfcCeWK807P/lipbsIPr02M4KTN7phgw2Ej80PPf4zx2EmmXz0zmTXQHXbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.445502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a75293a92a80c9d6a3a69b0cd6b1ca18d1cfb9e2bb1339bc9b2d965ddc43970","sha256:8a3951a57742282f2e1a6c7792cbc9860f6a93579f41d401378d1885768002ce"],"state_sha256":"e37a23b09309995e815e0d9e702a261655cf3b2fd7bb8d34d715210da78fba2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEIe5N+cmkjKJZeGrXHlmk3huHycixKWaiCel1hzGjIhc4gcSujYKq8lwd3bBlgQIGncHPE4jeIdqktDsrz7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:49:26.762151Z","bundle_sha256":"880b80436523f78afbccfad94ef6651db2bc7766bb221aadc4ca9ada4932f7fe"}}