{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LBC7DSKPXWHMMYEF2S3F4TKVH5","short_pith_number":"pith:LBC7DSKP","canonical_record":{"source":{"id":"1709.03062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-10T07:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"a55cd9dec927e6e31f6c2d217e52d8b0b712612823f8b68deaaf4a4a3dc1e808","abstract_canon_sha256":"4174434ddcf3f07b0dedd36f90281e3fc763cda2c99bdce2b0fc7636149de69e"},"schema_version":"1.0"},"canonical_sha256":"5845f1c94fbd8ec66085d4b65e4d553f4816935c3d85f3ed6125736400111acc","source":{"kind":"arxiv","id":"1709.03062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03062","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03062v1","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03062","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"LBC7DSKPXWHM","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LBC7DSKPXWHMMYEF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LBC7DSKP","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LBC7DSKPXWHMMYEF2S3F4TKVH5","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-10T07:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"a55cd9dec927e6e31f6c2d217e52d8b0b712612823f8b68deaaf4a4a3dc1e808","abstract_canon_sha256":"4174434ddcf3f07b0dedd36f90281e3fc763cda2c99bdce2b0fc7636149de69e"},"schema_version":"1.0"},"canonical_sha256":"5845f1c94fbd8ec66085d4b65e4d553f4816935c3d85f3ed6125736400111acc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:39.509553Z","signature_b64":"jmYqiOalBWh2j5/c2XzWR+4SYerkCwxO2dN/P05K2ae6xo7cgVtuHB+2MjToU+EOfR6Jp5kbGcUtDVq6m6+jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5845f1c94fbd8ec66085d4b65e4d553f4816935c3d85f3ed6125736400111acc","last_reissued_at":"2026-05-18T00:35:39.509036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:39.509036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03062","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:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wx6BwnLXLfHjOWoE7GeCBiCg/CpOjMlXE2tGq7lFLoP6fktIy0nxFXcd4kd7KFFVSpuVfDLxgLQWdiDRfxwaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:39:41.456179Z"},"content_sha256":"316a855da0d47feae576de1c342df250f774aa972ab7c9cdb2228472f74279c4","schema_version":"1.0","event_id":"sha256:316a855da0d47feae576de1c342df250f774aa972ab7c9cdb2228472f74279c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LBC7DSKPXWHMMYEF2S3F4TKVH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A DC Programming Approach for Solving Multicast Network Design Problems via the Nesterov Smoothing Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"A. Semenov, E. Pasiliao, N. M. Nam, V. Boginski, W. Geremew","submitted_at":"2017-09-10T07:40:01Z","abstract_excerpt":"This paper continues our effort initiated in [9] to study Multicast Communication Networks, modeled as bilevel hierarchical clustering problems, by using mathematical optimization techniques. Given a finite number of nodes, we consider two different models of multicast networks by identifying a certain number of nodes as cluster centers, and at the same time, locating a particular node that serves as a total center so as to minimize the total transportation cost through the network. The fact that the cluster centers and the total center have to be among the given nodes makes this problem a dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03062","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:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09IMPk7/qaDEamF3j3gd6WR1mymPMWpMbdM7mbg93Q26e/wkiWnKgO4c0bbGohLUqitHBCYIaSs2SUxrdnRLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:39:41.456556Z"},"content_sha256":"081238088b77d38e4601b7a3cfe6cb3290a135ccb99a3bab71ebe7c0600d7125","schema_version":"1.0","event_id":"sha256:081238088b77d38e4601b7a3cfe6cb3290a135ccb99a3bab71ebe7c0600d7125"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBC7DSKPXWHMMYEF2S3F4TKVH5/bundle.json","state_url":"https://pith.science/pith/LBC7DSKPXWHMMYEF2S3F4TKVH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBC7DSKPXWHMMYEF2S3F4TKVH5/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-07-01T23:39:41Z","links":{"resolver":"https://pith.science/pith/LBC7DSKPXWHMMYEF2S3F4TKVH5","bundle":"https://pith.science/pith/LBC7DSKPXWHMMYEF2S3F4TKVH5/bundle.json","state":"https://pith.science/pith/LBC7DSKPXWHMMYEF2S3F4TKVH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBC7DSKPXWHMMYEF2S3F4TKVH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LBC7DSKPXWHMMYEF2S3F4TKVH5","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":"4174434ddcf3f07b0dedd36f90281e3fc763cda2c99bdce2b0fc7636149de69e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-10T07:40:01Z","title_canon_sha256":"a55cd9dec927e6e31f6c2d217e52d8b0b712612823f8b68deaaf4a4a3dc1e808"},"schema_version":"1.0","source":{"id":"1709.03062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03062","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03062v1","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03062","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"LBC7DSKPXWHM","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LBC7DSKPXWHMMYEF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LBC7DSKP","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:081238088b77d38e4601b7a3cfe6cb3290a135ccb99a3bab71ebe7c0600d7125","target":"graph","created_at":"2026-05-18T00:35:39Z","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":"This paper continues our effort initiated in [9] to study Multicast Communication Networks, modeled as bilevel hierarchical clustering problems, by using mathematical optimization techniques. Given a finite number of nodes, we consider two different models of multicast networks by identifying a certain number of nodes as cluster centers, and at the same time, locating a particular node that serves as a total center so as to minimize the total transportation cost through the network. The fact that the cluster centers and the total center have to be among the given nodes makes this problem a dis","authors_text":"A. Semenov, E. Pasiliao, N. M. Nam, V. Boginski, W. Geremew","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-10T07:40:01Z","title":"A DC Programming Approach for Solving Multicast Network Design Problems via the Nesterov Smoothing Technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03062","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:316a855da0d47feae576de1c342df250f774aa972ab7c9cdb2228472f74279c4","target":"record","created_at":"2026-05-18T00:35:39Z","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":"4174434ddcf3f07b0dedd36f90281e3fc763cda2c99bdce2b0fc7636149de69e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-10T07:40:01Z","title_canon_sha256":"a55cd9dec927e6e31f6c2d217e52d8b0b712612823f8b68deaaf4a4a3dc1e808"},"schema_version":"1.0","source":{"id":"1709.03062","kind":"arxiv","version":1}},"canonical_sha256":"5845f1c94fbd8ec66085d4b65e4d553f4816935c3d85f3ed6125736400111acc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5845f1c94fbd8ec66085d4b65e4d553f4816935c3d85f3ed6125736400111acc","first_computed_at":"2026-05-18T00:35:39.509036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:39.509036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jmYqiOalBWh2j5/c2XzWR+4SYerkCwxO2dN/P05K2ae6xo7cgVtuHB+2MjToU+EOfR6Jp5kbGcUtDVq6m6+jAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:39.509553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:316a855da0d47feae576de1c342df250f774aa972ab7c9cdb2228472f74279c4","sha256:081238088b77d38e4601b7a3cfe6cb3290a135ccb99a3bab71ebe7c0600d7125"],"state_sha256":"34a14aa6cbce768b7359cf815fabb3abcf1907402587e2c61787846c132b51a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZeTLsLg7H4NghEXA/pA/QTwtvK9fuLYGCC2Snf6ooJRUzVG3n/bkZ3NxB6S8PKTju8bbQ4Zu3iZIwMU01ZpbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:39:41.458606Z","bundle_sha256":"7b4c520691d79fe37c1aaee6dfaeb0e1aab2647a44493a47ae3ec131fc247770"}}