{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CZYC7PU7KFT455WVGYX5PQX4R5","short_pith_number":"pith:CZYC7PU7","schema_version":"1.0","canonical_sha256":"16702fbe9f5167cef6d5362fd7c2fc8f5861d2d852b7a34dffe63eda8e2682bd","source":{"kind":"arxiv","id":"1310.0346","version":1},"attestation_state":"computed","paper":{"title":"The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.NI","authors_text":"Matthias Rost, Stefan Schmid","submitted_at":"2013-10-01T15:33:30Z","abstract_excerpt":"As the Internet becomes more virtualized and software-defined, new functionality is introduced in the network core: the distributed resources available in ISP central offices, universal nodes, or datacenter middleboxes can be used to process (e.g., filter, aggregate or duplicate) data. Based on this new networking paradigm, we formulate the Constrained Virtual Steiner Arborescence Problem (CVSAP) which asks for optimal locations to perform In-network processing, in order to jointly minimize processing costs and network traffic while respecting link and node capacities.\n  We prove that CVSAP ca"},"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":"1310.0346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-10-01T15:33:30Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"2ed9e224db0a51b972319f466709b1920e3ecaef76ebd36b733522edacb66f02","abstract_canon_sha256":"024623b0e46f6e38b4671c183a70e9257183b0e18662d27e8263498267280102"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:36.523661Z","signature_b64":"5S9Mi/cYCmcQPYJGTMn0w/f1ahGnGueJuokPEwRiPMdh6Y9BWObo3EM/VVh+D/t6mEtkEo7wP6Xvne74DFI8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16702fbe9f5167cef6d5362fd7c2fc8f5861d2d852b7a34dffe63eda8e2682bd","last_reissued_at":"2026-05-18T03:11:36.522940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:36.522940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.NI","authors_text":"Matthias Rost, Stefan Schmid","submitted_at":"2013-10-01T15:33:30Z","abstract_excerpt":"As the Internet becomes more virtualized and software-defined, new functionality is introduced in the network core: the distributed resources available in ISP central offices, universal nodes, or datacenter middleboxes can be used to process (e.g., filter, aggregate or duplicate) data. Based on this new networking paradigm, we formulate the Constrained Virtual Steiner Arborescence Problem (CVSAP) which asks for optimal locations to perform In-network processing, in order to jointly minimize processing costs and network traffic while respecting link and node capacities.\n  We prove that CVSAP ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0346","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":"1310.0346","created_at":"2026-05-18T03:11:36.523056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0346v1","created_at":"2026-05-18T03:11:36.523056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0346","created_at":"2026-05-18T03:11:36.523056+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZYC7PU7KFT4","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZYC7PU7KFT455WV","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZYC7PU7","created_at":"2026-05-18T12:27:40.988391+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/CZYC7PU7KFT455WVGYX5PQX4R5","json":"https://pith.science/pith/CZYC7PU7KFT455WVGYX5PQX4R5.json","graph_json":"https://pith.science/api/pith-number/CZYC7PU7KFT455WVGYX5PQX4R5/graph.json","events_json":"https://pith.science/api/pith-number/CZYC7PU7KFT455WVGYX5PQX4R5/events.json","paper":"https://pith.science/paper/CZYC7PU7"},"agent_actions":{"view_html":"https://pith.science/pith/CZYC7PU7KFT455WVGYX5PQX4R5","download_json":"https://pith.science/pith/CZYC7PU7KFT455WVGYX5PQX4R5.json","view_paper":"https://pith.science/paper/CZYC7PU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0346&json=true","fetch_graph":"https://pith.science/api/pith-number/CZYC7PU7KFT455WVGYX5PQX4R5/graph.json","fetch_events":"https://pith.science/api/pith-number/CZYC7PU7KFT455WVGYX5PQX4R5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZYC7PU7KFT455WVGYX5PQX4R5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZYC7PU7KFT455WVGYX5PQX4R5/action/storage_attestation","attest_author":"https://pith.science/pith/CZYC7PU7KFT455WVGYX5PQX4R5/action/author_attestation","sign_citation":"https://pith.science/pith/CZYC7PU7KFT455WVGYX5PQX4R5/action/citation_signature","submit_replication":"https://pith.science/pith/CZYC7PU7KFT455WVGYX5PQX4R5/action/replication_record"}},"created_at":"2026-05-18T03:11:36.523056+00:00","updated_at":"2026-05-18T03:11:36.523056+00:00"}