{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HI35HYNUCXIRBS5MEVENWK73PN","short_pith_number":"pith:HI35HYNU","canonical_record":{"source":{"id":"1603.09158","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T12:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"661285caad867ce7ad7570947c888ebf0e3e5cc09e91399e1f0ec9b007b780f1","abstract_canon_sha256":"b0645ca72753e0cd0cbc044f7e1c13f88aa6e7061a72ae286e88321538316ca2"},"schema_version":"1.0"},"canonical_sha256":"3a37d3e1b415d110cbac2548db2bfb7b7425b36ed5012ea644bbef1fef7987c3","source":{"kind":"arxiv","id":"1603.09158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09158","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09158v1","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09158","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"pith_short_12","alias_value":"HI35HYNUCXIR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HI35HYNUCXIRBS5M","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HI35HYNU","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HI35HYNUCXIRBS5MEVENWK73PN","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09158","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T12:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"661285caad867ce7ad7570947c888ebf0e3e5cc09e91399e1f0ec9b007b780f1","abstract_canon_sha256":"b0645ca72753e0cd0cbc044f7e1c13f88aa6e7061a72ae286e88321538316ca2"},"schema_version":"1.0"},"canonical_sha256":"3a37d3e1b415d110cbac2548db2bfb7b7425b36ed5012ea644bbef1fef7987c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:01.288859Z","signature_b64":"YPHHX9+MKGJeKgaTspeqBjWAegLbnpbs4KD1O6G6SiE8fxjKzCMn/s10UKXqrNyeckRLymg3KHszHwNtetB7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a37d3e1b415d110cbac2548db2bfb7b7425b36ed5012ea644bbef1fef7987c3","last_reissued_at":"2026-05-18T01:18:01.288229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:01.288229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09158","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-18T01:18:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iEoGcxxn+uAj9CPDcD3qO5JgFBsAQM8NDIP0at/X1yMCF5OT/H5hn2LRYCGKZN30xHv3+oN+7yjpbjAq+bXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:05:33.421093Z"},"content_sha256":"cb8cc464e2261f31e149006be0332c2a67a86048484489648ec8716376dfd4d2","schema_version":"1.0","event_id":"sha256:cb8cc464e2261f31e149006be0332c2a67a86048484489648ec8716376dfd4d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HI35HYNUCXIRBS5MEVENWK73PN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for Path Computation and Function Placement in SDNs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Guy Even, Matthias Rost, Stefan Schmid","submitted_at":"2016-03-30T12:39:38Z","abstract_excerpt":"We consider the task of computing (combined) function mapping and routing for requests in Software-Defined Networks (SDNs). Function mapping refers to the assignment of nodes in the substrate network to various processing stages that requests must undergo. Routing refers to the assignment of a path in the substrate network that begins in a source node of the request, traverses the nodes that are assigned functions for this request, and ends in a destination of the request. The algorithm either rejects a request or completely serves a request, and its goal is to maximize the sum of the benefits"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09158","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-18T01:18:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6nofaP2Eyl1YhsJ6zqn2wN81dK1fO5GYt49w6ZMCgLsAl+ErUcljx78oVV21mNvs8utFO4F1A8lgi+R1NYTFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:05:33.421689Z"},"content_sha256":"3a4b21f6a909b7c436f6cd02bc247011d2d8668c6b3e719ac68019899d75fae8","schema_version":"1.0","event_id":"sha256:3a4b21f6a909b7c436f6cd02bc247011d2d8668c6b3e719ac68019899d75fae8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HI35HYNUCXIRBS5MEVENWK73PN/bundle.json","state_url":"https://pith.science/pith/HI35HYNUCXIRBS5MEVENWK73PN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HI35HYNUCXIRBS5MEVENWK73PN/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-06-07T09:05:33Z","links":{"resolver":"https://pith.science/pith/HI35HYNUCXIRBS5MEVENWK73PN","bundle":"https://pith.science/pith/HI35HYNUCXIRBS5MEVENWK73PN/bundle.json","state":"https://pith.science/pith/HI35HYNUCXIRBS5MEVENWK73PN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HI35HYNUCXIRBS5MEVENWK73PN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HI35HYNUCXIRBS5MEVENWK73PN","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":"b0645ca72753e0cd0cbc044f7e1c13f88aa6e7061a72ae286e88321538316ca2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T12:39:38Z","title_canon_sha256":"661285caad867ce7ad7570947c888ebf0e3e5cc09e91399e1f0ec9b007b780f1"},"schema_version":"1.0","source":{"id":"1603.09158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09158","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09158v1","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09158","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"pith_short_12","alias_value":"HI35HYNUCXIR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HI35HYNUCXIRBS5M","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HI35HYNU","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:3a4b21f6a909b7c436f6cd02bc247011d2d8668c6b3e719ac68019899d75fae8","target":"graph","created_at":"2026-05-18T01:18:01Z","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":"We consider the task of computing (combined) function mapping and routing for requests in Software-Defined Networks (SDNs). Function mapping refers to the assignment of nodes in the substrate network to various processing stages that requests must undergo. Routing refers to the assignment of a path in the substrate network that begins in a source node of the request, traverses the nodes that are assigned functions for this request, and ends in a destination of the request. The algorithm either rejects a request or completely serves a request, and its goal is to maximize the sum of the benefits","authors_text":"Guy Even, Matthias Rost, Stefan Schmid","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T12:39:38Z","title":"An Approximation Algorithm for Path Computation and Function Placement in SDNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09158","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:cb8cc464e2261f31e149006be0332c2a67a86048484489648ec8716376dfd4d2","target":"record","created_at":"2026-05-18T01:18:01Z","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":"b0645ca72753e0cd0cbc044f7e1c13f88aa6e7061a72ae286e88321538316ca2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T12:39:38Z","title_canon_sha256":"661285caad867ce7ad7570947c888ebf0e3e5cc09e91399e1f0ec9b007b780f1"},"schema_version":"1.0","source":{"id":"1603.09158","kind":"arxiv","version":1}},"canonical_sha256":"3a37d3e1b415d110cbac2548db2bfb7b7425b36ed5012ea644bbef1fef7987c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a37d3e1b415d110cbac2548db2bfb7b7425b36ed5012ea644bbef1fef7987c3","first_computed_at":"2026-05-18T01:18:01.288229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:01.288229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YPHHX9+MKGJeKgaTspeqBjWAegLbnpbs4KD1O6G6SiE8fxjKzCMn/s10UKXqrNyeckRLymg3KHszHwNtetB7DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:01.288859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb8cc464e2261f31e149006be0332c2a67a86048484489648ec8716376dfd4d2","sha256:3a4b21f6a909b7c436f6cd02bc247011d2d8668c6b3e719ac68019899d75fae8"],"state_sha256":"ef52627dfe94dad539aa2bda6f2136d3a1271e0de070d17a0327077c2a994af0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoNsQGIzZ7UxjaAe6w4QtxwjdqLMpbNb2P81WYaLIymA1zgpKZYsxBMO/3GqZbff1GyJR9J8a2KRBNaNwTQSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:05:33.425104Z","bundle_sha256":"c12d3388c30b4e594accca91ba6e1a786bb7499f0f95162c5401049b35f66fe3"}}