{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WLDFMWOCEPRWVF4JTFBK23NQW6","short_pith_number":"pith:WLDFMWOC","schema_version":"1.0","canonical_sha256":"b2c65659c223e36a97899942ad6db0b7817993d55dd500b7a1b906e0874f5aa6","source":{"kind":"arxiv","id":"1706.06496","version":1},"attestation_state":"computed","paper":{"title":"Approximate and Incremental Network Function Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Matthias Rost, Stefan Schmid, Tamas Lukovszki","submitted_at":"2017-06-20T14:49:53Z","abstract_excerpt":"The virtualization and softwarization of modern computer networks introduces interesting new opportunities for a more flexible placement of network functions and middleboxes (firewalls, proxies, traffic optimizers, virtual switches, etc.). This paper studies approximation algorithms for the incremental deployment of a minimum number of middleboxes at optimal locations, such that capacity constraints at the middleboxes and length constraints on the communication routes are respected. Our main contribution is a new, purely combinatorial and rigorous proof for the submodularity of the function ma"},"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":"1706.06496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-20T14:49:53Z","cross_cats_sorted":[],"title_canon_sha256":"4cd6a9178c761a13c1ceca58f1fc0d9537f28718a00d9a142a133e2b58bf454f","abstract_canon_sha256":"5a685728182a3ea6d1e70d08b36d4fc7baf5d136c5daf56d45a4378c076002ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:03.090668Z","signature_b64":"bbC2Hm6kxxxB+SvfEz972VbUy6rUP7NRTFI+ammTjOmPVZi05EYU/Fcg1wJG5a8RX5nAxptPtUoTd8et5/9WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2c65659c223e36a97899942ad6db0b7817993d55dd500b7a1b906e0874f5aa6","last_reissued_at":"2026-05-18T00:42:03.090049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:03.090049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate and Incremental Network Function Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Matthias Rost, Stefan Schmid, Tamas Lukovszki","submitted_at":"2017-06-20T14:49:53Z","abstract_excerpt":"The virtualization and softwarization of modern computer networks introduces interesting new opportunities for a more flexible placement of network functions and middleboxes (firewalls, proxies, traffic optimizers, virtual switches, etc.). This paper studies approximation algorithms for the incremental deployment of a minimum number of middleboxes at optimal locations, such that capacity constraints at the middleboxes and length constraints on the communication routes are respected. Our main contribution is a new, purely combinatorial and rigorous proof for the submodularity of the function ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06496","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":"1706.06496","created_at":"2026-05-18T00:42:03.090149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06496v1","created_at":"2026-05-18T00:42:03.090149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06496","created_at":"2026-05-18T00:42:03.090149+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLDFMWOCEPRW","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLDFMWOCEPRWVF4J","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLDFMWOC","created_at":"2026-05-18T12:31:53.515858+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/WLDFMWOCEPRWVF4JTFBK23NQW6","json":"https://pith.science/pith/WLDFMWOCEPRWVF4JTFBK23NQW6.json","graph_json":"https://pith.science/api/pith-number/WLDFMWOCEPRWVF4JTFBK23NQW6/graph.json","events_json":"https://pith.science/api/pith-number/WLDFMWOCEPRWVF4JTFBK23NQW6/events.json","paper":"https://pith.science/paper/WLDFMWOC"},"agent_actions":{"view_html":"https://pith.science/pith/WLDFMWOCEPRWVF4JTFBK23NQW6","download_json":"https://pith.science/pith/WLDFMWOCEPRWVF4JTFBK23NQW6.json","view_paper":"https://pith.science/paper/WLDFMWOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06496&json=true","fetch_graph":"https://pith.science/api/pith-number/WLDFMWOCEPRWVF4JTFBK23NQW6/graph.json","fetch_events":"https://pith.science/api/pith-number/WLDFMWOCEPRWVF4JTFBK23NQW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLDFMWOCEPRWVF4JTFBK23NQW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLDFMWOCEPRWVF4JTFBK23NQW6/action/storage_attestation","attest_author":"https://pith.science/pith/WLDFMWOCEPRWVF4JTFBK23NQW6/action/author_attestation","sign_citation":"https://pith.science/pith/WLDFMWOCEPRWVF4JTFBK23NQW6/action/citation_signature","submit_replication":"https://pith.science/pith/WLDFMWOCEPRWVF4JTFBK23NQW6/action/replication_record"}},"created_at":"2026-05-18T00:42:03.090149+00:00","updated_at":"2026-05-18T00:42:03.090149+00:00"}