{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FBDUL2LYREY222K3Q7UKFX6HPC","short_pith_number":"pith:FBDUL2LY","canonical_record":{"source":{"id":"1404.3454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-14T02:52:46Z","cross_cats_sorted":[],"title_canon_sha256":"d58ec2708eb5aa82b7c9e7dc32c31dd4a96f4154c14f7d407f02d48ae4f67af1","abstract_canon_sha256":"552aaec3244e5836e0a617c251f6dbfa709fabcc2d27dc1d1adbbbd6d3ef366e"},"schema_version":"1.0"},"canonical_sha256":"284745e9788931ad695b87e8a2dfc77893b0cf706c16ef62653853b2e60da4d1","source":{"kind":"arxiv","id":"1404.3454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3454","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3454v2","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3454","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"FBDUL2LYREY2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FBDUL2LYREY222K3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FBDUL2LY","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FBDUL2LYREY222K3Q7UKFX6HPC","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-14T02:52:46Z","cross_cats_sorted":[],"title_canon_sha256":"d58ec2708eb5aa82b7c9e7dc32c31dd4a96f4154c14f7d407f02d48ae4f67af1","abstract_canon_sha256":"552aaec3244e5836e0a617c251f6dbfa709fabcc2d27dc1d1adbbbd6d3ef366e"},"schema_version":"1.0"},"canonical_sha256":"284745e9788931ad695b87e8a2dfc77893b0cf706c16ef62653853b2e60da4d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:23.001969Z","signature_b64":"fkk52lsYVTcKZTk8rJd85e0IovDrc6sCd3WYkALJMP16ZzWHIgR0G0PBTUPYiiPQ8VEFwaPMh6ABI0PFUD4UCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"284745e9788931ad695b87e8a2dfc77893b0cf706c16ef62653853b2e60da4d1","last_reissued_at":"2026-05-18T02:52:23.001292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:23.001292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3454","source_version":2,"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-18T02:52:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYFsv6bnpldovJAQ7SF5JzL/0JYqrh5fIsw99Jgu3wM0M4VQBpkmpQCFoiM6fWsEtJ82iOam/RGhQGk+ZPj7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:56:33.561694Z"},"content_sha256":"8eb182c56723fa086b5eb30ff7ffb3f97667a312bb917b7611e8032b0426895a","schema_version":"1.0","event_id":"sha256:8eb182c56723fa086b5eb30ff7ffb3f97667a312bb917b7611e8032b0426895a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FBDUL2LYREY222K3Q7UKFX6HPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Steiner Tree for Multicast Communications in Software-Defined Networking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chih-Chung Lin, De-Nian Yang, Hui-Ju Hung, Liang-Hao Huang","submitted_at":"2014-04-14T02:52:46Z","abstract_excerpt":"Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, but at the same time the scalability problem becomes more serious since traffic is more difficult to be aggregated. Those crucial issues in SDN have been studied for unicast but have not been explored for multicast traffic, and addressing those issues for multicast is more challenging since the identities and the number of members in a multicast group can be arbitrary. In this paper, therefore, we propose a new multicast tree for SDN, named Branch-aware Steiner Tree (BST). The BST problem i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3454","kind":"arxiv","version":2},"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-18T02:52:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gp8vBfBSzF/56sq/bKExsfIcV1sNSK/b+mPMLceJ67FWkeG70g2jVByea3zHgEN5hrl1YDywtDL2jNTuiytNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:56:33.562347Z"},"content_sha256":"baf2086853a82b6a90c5a6812c37b562086aa59024561ac390674439b8f556a1","schema_version":"1.0","event_id":"sha256:baf2086853a82b6a90c5a6812c37b562086aa59024561ac390674439b8f556a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBDUL2LYREY222K3Q7UKFX6HPC/bundle.json","state_url":"https://pith.science/pith/FBDUL2LYREY222K3Q7UKFX6HPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBDUL2LYREY222K3Q7UKFX6HPC/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-05-27T07:56:33Z","links":{"resolver":"https://pith.science/pith/FBDUL2LYREY222K3Q7UKFX6HPC","bundle":"https://pith.science/pith/FBDUL2LYREY222K3Q7UKFX6HPC/bundle.json","state":"https://pith.science/pith/FBDUL2LYREY222K3Q7UKFX6HPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBDUL2LYREY222K3Q7UKFX6HPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FBDUL2LYREY222K3Q7UKFX6HPC","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":"552aaec3244e5836e0a617c251f6dbfa709fabcc2d27dc1d1adbbbd6d3ef366e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-14T02:52:46Z","title_canon_sha256":"d58ec2708eb5aa82b7c9e7dc32c31dd4a96f4154c14f7d407f02d48ae4f67af1"},"schema_version":"1.0","source":{"id":"1404.3454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3454","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3454v2","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3454","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"FBDUL2LYREY2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FBDUL2LYREY222K3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FBDUL2LY","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:baf2086853a82b6a90c5a6812c37b562086aa59024561ac390674439b8f556a1","target":"graph","created_at":"2026-05-18T02:52:23Z","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":"Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, but at the same time the scalability problem becomes more serious since traffic is more difficult to be aggregated. Those crucial issues in SDN have been studied for unicast but have not been explored for multicast traffic, and addressing those issues for multicast is more challenging since the identities and the number of members in a multicast group can be arbitrary. In this paper, therefore, we propose a new multicast tree for SDN, named Branch-aware Steiner Tree (BST). The BST problem i","authors_text":"Chih-Chung Lin, De-Nian Yang, Hui-Ju Hung, Liang-Hao Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-14T02:52:46Z","title":"Scalable Steiner Tree for Multicast Communications in Software-Defined Networking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3454","kind":"arxiv","version":2},"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:8eb182c56723fa086b5eb30ff7ffb3f97667a312bb917b7611e8032b0426895a","target":"record","created_at":"2026-05-18T02:52:23Z","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":"552aaec3244e5836e0a617c251f6dbfa709fabcc2d27dc1d1adbbbd6d3ef366e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-14T02:52:46Z","title_canon_sha256":"d58ec2708eb5aa82b7c9e7dc32c31dd4a96f4154c14f7d407f02d48ae4f67af1"},"schema_version":"1.0","source":{"id":"1404.3454","kind":"arxiv","version":2}},"canonical_sha256":"284745e9788931ad695b87e8a2dfc77893b0cf706c16ef62653853b2e60da4d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"284745e9788931ad695b87e8a2dfc77893b0cf706c16ef62653853b2e60da4d1","first_computed_at":"2026-05-18T02:52:23.001292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:23.001292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkk52lsYVTcKZTk8rJd85e0IovDrc6sCd3WYkALJMP16ZzWHIgR0G0PBTUPYiiPQ8VEFwaPMh6ABI0PFUD4UCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:23.001969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eb182c56723fa086b5eb30ff7ffb3f97667a312bb917b7611e8032b0426895a","sha256:baf2086853a82b6a90c5a6812c37b562086aa59024561ac390674439b8f556a1"],"state_sha256":"a83cd6940d6c623d94991a5f1421147321d6c0d87bacf51d464b25f8a1c4d3be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwTe0EO8wm4CjldEEoXSt+5itK/bNP7IE4vPrVenpSEOFHEsy+ODuaQT5+GI2btYzlG+u6+3UGFeYL/A4PwnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:56:33.565580Z","bundle_sha256":"bd8dba7d87b44486f416501c49119e611a65f75f95dd17fcc141f381a45da885"}}