{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VBTSQDRMG4I36NIGOMXGE4JGIN","short_pith_number":"pith:VBTSQDRM","canonical_record":{"source":{"id":"2509.10001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-09-12T06:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"860b17749097bdcc5da9ea3c7544eed7ec8f3685aaf511133fc4caab3e75f1da","abstract_canon_sha256":"7b5b9e26b689f935fffd8eea69ed84ff64d15a50694ed76140e41197cebd7683"},"schema_version":"1.0"},"canonical_sha256":"a867280e2c3711bf3506732e627126434ed7166b1e22c52ace2c0f02f511619a","source":{"kind":"arxiv","id":"2509.10001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.10001","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"2509.10001v1","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10001","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"VBTSQDRMG4I3","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"pith_short_16","alias_value":"VBTSQDRMG4I36NIG","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"pith_short_8","alias_value":"VBTSQDRM","created_at":"2026-07-05T12:09:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VBTSQDRMG4I36NIGOMXGE4JGIN","target":"record","payload":{"canonical_record":{"source":{"id":"2509.10001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-09-12T06:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"860b17749097bdcc5da9ea3c7544eed7ec8f3685aaf511133fc4caab3e75f1da","abstract_canon_sha256":"7b5b9e26b689f935fffd8eea69ed84ff64d15a50694ed76140e41197cebd7683"},"schema_version":"1.0"},"canonical_sha256":"a867280e2c3711bf3506732e627126434ed7166b1e22c52ace2c0f02f511619a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:53.498417Z","signature_b64":"6HRtuc1elm/uXtn97Jmxlkfx2UatW3b9Xl2Ge3iw22Cja0wnuosFWDOurVmjTNhIuyMGm0lv5smPDv1kPI/fDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a867280e2c3711bf3506732e627126434ed7166b1e22c52ace2c0f02f511619a","last_reissued_at":"2026-07-05T12:09:53.497933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:53.497933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.10001","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-07-05T12:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xm1qjY0pESAOeAlDEnnI5daA2YhjjMT/n4SaKYAOX7KSWJmRKABAthJaW05Mzz62TJjdyiKF+LyceAQPUrcUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T02:27:28.751934Z"},"content_sha256":"8a00786bfd45384600c9342fe90a6c9de9cebfce8116af8bff91c2a5d1187923","schema_version":"1.0","event_id":"sha256:8a00786bfd45384600c9342fe90a6c9de9cebfce8116af8bff91c2a5d1187923"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VBTSQDRMG4I36NIGOMXGE4JGIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Service Function Chaining Architecture for Multi-hop Split Inference and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Masahiro Sasabe, Takanori Hara","submitted_at":"2025-09-12T06:52:39Z","abstract_excerpt":"Service Function Chaining (SFC) is a networking technique that ensures traffic traverses a predefined sequence of service functions, realizing arbitrary network services through dynamic and efficient communication paths. Inspired by this concept, we propose an SFC-based architecture for Multi-hop Split Inference (MSI), where split sub-models are interpreted as service functions and their composition forms a service chain representing the global model. By leveraging SFC, the proposed architecture dynamically establishes communication paths for split sub-models, ensuring efficient and adaptive e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10001","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.10001/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T12:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/enZZfJdCA9xLYvDYIHt9n/NwxW2cqdumCLRFsIO5dAJi4d+pIcwNtt28qm7LVrVzezrk7Hms6vTBOQJPg5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T02:27:28.752446Z"},"content_sha256":"b3559594fbd8c4217f2703d002c5d1bd341708bc07d424e50c06fff0b2e43544","schema_version":"1.0","event_id":"sha256:b3559594fbd8c4217f2703d002c5d1bd341708bc07d424e50c06fff0b2e43544"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBTSQDRMG4I36NIGOMXGE4JGIN/bundle.json","state_url":"https://pith.science/pith/VBTSQDRMG4I36NIGOMXGE4JGIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBTSQDRMG4I36NIGOMXGE4JGIN/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-08-10T02:27:28Z","links":{"resolver":"https://pith.science/pith/VBTSQDRMG4I36NIGOMXGE4JGIN","bundle":"https://pith.science/pith/VBTSQDRMG4I36NIGOMXGE4JGIN/bundle.json","state":"https://pith.science/pith/VBTSQDRMG4I36NIGOMXGE4JGIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBTSQDRMG4I36NIGOMXGE4JGIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VBTSQDRMG4I36NIGOMXGE4JGIN","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":"7b5b9e26b689f935fffd8eea69ed84ff64d15a50694ed76140e41197cebd7683","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-09-12T06:52:39Z","title_canon_sha256":"860b17749097bdcc5da9ea3c7544eed7ec8f3685aaf511133fc4caab3e75f1da"},"schema_version":"1.0","source":{"id":"2509.10001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.10001","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"2509.10001v1","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10001","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"VBTSQDRMG4I3","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"pith_short_16","alias_value":"VBTSQDRMG4I36NIG","created_at":"2026-07-05T12:09:53Z"},{"alias_kind":"pith_short_8","alias_value":"VBTSQDRM","created_at":"2026-07-05T12:09:53Z"}],"graph_snapshots":[{"event_id":"sha256:b3559594fbd8c4217f2703d002c5d1bd341708bc07d424e50c06fff0b2e43544","target":"graph","created_at":"2026-07-05T12:09:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.10001/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Service Function Chaining (SFC) is a networking technique that ensures traffic traverses a predefined sequence of service functions, realizing arbitrary network services through dynamic and efficient communication paths. Inspired by this concept, we propose an SFC-based architecture for Multi-hop Split Inference (MSI), where split sub-models are interpreted as service functions and their composition forms a service chain representing the global model. By leveraging SFC, the proposed architecture dynamically establishes communication paths for split sub-models, ensuring efficient and adaptive e","authors_text":"Masahiro Sasabe, Takanori Hara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-09-12T06:52:39Z","title":"Service Function Chaining Architecture for Multi-hop Split Inference and Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10001","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:8a00786bfd45384600c9342fe90a6c9de9cebfce8116af8bff91c2a5d1187923","target":"record","created_at":"2026-07-05T12:09:53Z","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":"7b5b9e26b689f935fffd8eea69ed84ff64d15a50694ed76140e41197cebd7683","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-09-12T06:52:39Z","title_canon_sha256":"860b17749097bdcc5da9ea3c7544eed7ec8f3685aaf511133fc4caab3e75f1da"},"schema_version":"1.0","source":{"id":"2509.10001","kind":"arxiv","version":1}},"canonical_sha256":"a867280e2c3711bf3506732e627126434ed7166b1e22c52ace2c0f02f511619a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a867280e2c3711bf3506732e627126434ed7166b1e22c52ace2c0f02f511619a","first_computed_at":"2026-07-05T12:09:53.497933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:09:53.497933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6HRtuc1elm/uXtn97Jmxlkfx2UatW3b9Xl2Ge3iw22Cja0wnuosFWDOurVmjTNhIuyMGm0lv5smPDv1kPI/fDw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:09:53.498417Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.10001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a00786bfd45384600c9342fe90a6c9de9cebfce8116af8bff91c2a5d1187923","sha256:b3559594fbd8c4217f2703d002c5d1bd341708bc07d424e50c06fff0b2e43544"],"state_sha256":"6b2c787bd38727ea0241c040ac696eb4ed046d700ae6fea0d3c9eae94e0b9e4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TgKcpa9uW+xJiwhEyu8wG92aS41OHW6gRyvDTLaDOIKAQjio6P2qwFbIwkQp31Bvvp4sL0hVKTkOGVPRsqNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T02:27:28.758081Z","bundle_sha256":"5b072d7f768faa77126d96da5e75bd0c3c652b708294c46a6d4a01171e0da3de"}}