{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:56RXPKSFQUHYHQ6JCAKU235NJR","short_pith_number":"pith:56RXPKSF","schema_version":"1.0","canonical_sha256":"efa377aa45850f83c3c910154d6fad4c73abf1216f02d92a25428e21df9f95a6","source":{"kind":"arxiv","id":"1306.4083","version":1},"attestation_state":"computed","paper":{"title":"Modeling the guaranteed delivery of bulk data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Gianluca Reali, Mauro Femminella, Roberto Francescangeli","submitted_at":"2013-06-18T07:10:49Z","abstract_excerpt":"The delivery of bulk data is an increasingly pressing problem in modern networks. While in some cases these transfers happen in background without specific constraints in terms of delivery times, there are a number of scenarios in which the transfer of tens of GB of data must occur in specific, limited time windows. In order to face this task, a suitable solution is the deployment of virtual links with guaranteed bandwidth between endpoints provided by a Service Overlay Network (SON) provider. We model this scenario as an optimization problem, in which the target consists of minimizing the cos"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.4083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-06-18T07:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"e2f4864d9d5ab6a2fe9e2f9dd7846c17850d91cb96d18197a76c18cdbcc3d075","abstract_canon_sha256":"9a494d1611ea05ff007cacb601e53219a08a7509ce57c7d51d8305f3e65dfa91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:44.427795Z","signature_b64":"UAVQmJVKXhsHXc/WkMmT2Opd+u2Te0Lp+/h2SFE7ph0xOPzy4P423QG96712lRW37oAeeen3OiSleW7R+14aDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efa377aa45850f83c3c910154d6fad4c73abf1216f02d92a25428e21df9f95a6","last_reissued_at":"2026-05-18T03:20:44.427138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:44.427138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling the guaranteed delivery of bulk data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Gianluca Reali, Mauro Femminella, Roberto Francescangeli","submitted_at":"2013-06-18T07:10:49Z","abstract_excerpt":"The delivery of bulk data is an increasingly pressing problem in modern networks. While in some cases these transfers happen in background without specific constraints in terms of delivery times, there are a number of scenarios in which the transfer of tens of GB of data must occur in specific, limited time windows. In order to face this task, a suitable solution is the deployment of virtual links with guaranteed bandwidth between endpoints provided by a Service Overlay Network (SON) provider. We model this scenario as an optimization problem, in which the target consists of minimizing the cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4083","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.4083","created_at":"2026-05-18T03:20:44.427255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4083v1","created_at":"2026-05-18T03:20:44.427255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4083","created_at":"2026-05-18T03:20:44.427255+00:00"},{"alias_kind":"pith_short_12","alias_value":"56RXPKSFQUHY","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"56RXPKSFQUHYHQ6J","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"56RXPKSF","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR","json":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR.json","graph_json":"https://pith.science/api/pith-number/56RXPKSFQUHYHQ6JCAKU235NJR/graph.json","events_json":"https://pith.science/api/pith-number/56RXPKSFQUHYHQ6JCAKU235NJR/events.json","paper":"https://pith.science/paper/56RXPKSF"},"agent_actions":{"view_html":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR","download_json":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR.json","view_paper":"https://pith.science/paper/56RXPKSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4083&json=true","fetch_graph":"https://pith.science/api/pith-number/56RXPKSFQUHYHQ6JCAKU235NJR/graph.json","fetch_events":"https://pith.science/api/pith-number/56RXPKSFQUHYHQ6JCAKU235NJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR/action/storage_attestation","attest_author":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR/action/author_attestation","sign_citation":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR/action/citation_signature","submit_replication":"https://pith.science/pith/56RXPKSFQUHYHQ6JCAKU235NJR/action/replication_record"}},"created_at":"2026-05-18T03:20:44.427255+00:00","updated_at":"2026-05-18T03:20:44.427255+00:00"}