{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5OID3GELSZY3G66SZAPT5DUFJF","short_pith_number":"pith:5OID3GEL","canonical_record":{"source":{"id":"1704.04182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T15:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"f6f40c75b60d753bc44743f13ab7546db12f3fca9a83be3d49ca27366d4ba9bf","abstract_canon_sha256":"f093df55a7ec87f5b573d933412fa5fef7a182c11aa8b844d3b20e8a90699444"},"schema_version":"1.0"},"canonical_sha256":"eb903d988b9671b37bd2c81f3e8e854950f268bfd72ae1bacdb7244f10e709d7","source":{"kind":"arxiv","id":"1704.04182","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04182","created_at":"2026-05-18T00:38:03Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04182v3","created_at":"2026-05-18T00:38:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04182","created_at":"2026-05-18T00:38:03Z"},{"alias_kind":"pith_short_12","alias_value":"5OID3GELSZY3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5OID3GELSZY3G66S","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5OID3GEL","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5OID3GELSZY3G66SZAPT5DUFJF","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T15:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"f6f40c75b60d753bc44743f13ab7546db12f3fca9a83be3d49ca27366d4ba9bf","abstract_canon_sha256":"f093df55a7ec87f5b573d933412fa5fef7a182c11aa8b844d3b20e8a90699444"},"schema_version":"1.0"},"canonical_sha256":"eb903d988b9671b37bd2c81f3e8e854950f268bfd72ae1bacdb7244f10e709d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:03.024683Z","signature_b64":"aCI7GqbZe9DahS+neHmXRDZODPCciD5O0uTvqXsVzHrRvqBLWaV7VTRgIb/+b8fGawTxRqGUpOY9FUExhB0wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb903d988b9671b37bd2c81f3e8e854950f268bfd72ae1bacdb7244f10e709d7","last_reissued_at":"2026-05-18T00:38:03.024193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:03.024193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04182","source_version":3,"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-18T00:38:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPS9MO/tYRlaDchfUjKVPTtUzLlFmb75x1S0CG4ZtdxJyrAEuTH0zxIrT2c/lQySG4mlBR2HbAKViEKrGS00Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:42:28.848721Z"},"content_sha256":"096ab8e939c25ea34e1a18137f53c90a5837f7ac264b9bb28eafc2a091ebdbe5","schema_version":"1.0","event_id":"sha256:096ab8e939c25ea34e1a18137f53c90a5837f7ac264b9bb28eafc2a091ebdbe5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5OID3GELSZY3G66SZAPT5DUFJF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Rate Control for Traffic Engineering with Aggregated Flows in Software Defined Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Cheng-Da Tsai, Chih-Hang Wang, De-Nian Yang, Jian-Jhih Kuo, Wen-Tsuen Chen","submitted_at":"2017-04-13T15:47:26Z","abstract_excerpt":"To increase the scalability of Software Defined Networks (SDNs), flow aggregation schemes have been proposed to merge multiple mouse flows into an elephant aggregated flow for traffic engineering. In this paper, we first notice that the user bit-rate requirements of mouse flows are no longer guaranteed in the aggregated flow since the flow rate decided by the TCP allocation is usually different from the desired bit-rate of each user. To address the above issue, we present a novel architecture, named Flexible Flow And Rate Management (F$^2$ARM), to control the rates of only a few flows in order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04182","kind":"arxiv","version":3},"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-18T00:38:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gy80S5n/jCNvL7fMwLftV8+5Y9jaafEeU693QXN/qpELex7YigpgBfnyC7mWf5uchctORvZCo6u83R9trL7CAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:42:28.849151Z"},"content_sha256":"fc8f37e584a621f1c54a0e71634c076e2ffb2a96d6e0037fb4271143b83fbab1","schema_version":"1.0","event_id":"sha256:fc8f37e584a621f1c54a0e71634c076e2ffb2a96d6e0037fb4271143b83fbab1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OID3GELSZY3G66SZAPT5DUFJF/bundle.json","state_url":"https://pith.science/pith/5OID3GELSZY3G66SZAPT5DUFJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OID3GELSZY3G66SZAPT5DUFJF/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-26T06:42:28Z","links":{"resolver":"https://pith.science/pith/5OID3GELSZY3G66SZAPT5DUFJF","bundle":"https://pith.science/pith/5OID3GELSZY3G66SZAPT5DUFJF/bundle.json","state":"https://pith.science/pith/5OID3GELSZY3G66SZAPT5DUFJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OID3GELSZY3G66SZAPT5DUFJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5OID3GELSZY3G66SZAPT5DUFJF","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":"f093df55a7ec87f5b573d933412fa5fef7a182c11aa8b844d3b20e8a90699444","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T15:47:26Z","title_canon_sha256":"f6f40c75b60d753bc44743f13ab7546db12f3fca9a83be3d49ca27366d4ba9bf"},"schema_version":"1.0","source":{"id":"1704.04182","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04182","created_at":"2026-05-18T00:38:03Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04182v3","created_at":"2026-05-18T00:38:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04182","created_at":"2026-05-18T00:38:03Z"},{"alias_kind":"pith_short_12","alias_value":"5OID3GELSZY3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5OID3GELSZY3G66S","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5OID3GEL","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:fc8f37e584a621f1c54a0e71634c076e2ffb2a96d6e0037fb4271143b83fbab1","target":"graph","created_at":"2026-05-18T00:38:03Z","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":"To increase the scalability of Software Defined Networks (SDNs), flow aggregation schemes have been proposed to merge multiple mouse flows into an elephant aggregated flow for traffic engineering. In this paper, we first notice that the user bit-rate requirements of mouse flows are no longer guaranteed in the aggregated flow since the flow rate decided by the TCP allocation is usually different from the desired bit-rate of each user. To address the above issue, we present a novel architecture, named Flexible Flow And Rate Management (F$^2$ARM), to control the rates of only a few flows in order","authors_text":"Cheng-Da Tsai, Chih-Hang Wang, De-Nian Yang, Jian-Jhih Kuo, Wen-Tsuen Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T15:47:26Z","title":"Scalable Rate Control for Traffic Engineering with Aggregated Flows in Software Defined Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04182","kind":"arxiv","version":3},"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:096ab8e939c25ea34e1a18137f53c90a5837f7ac264b9bb28eafc2a091ebdbe5","target":"record","created_at":"2026-05-18T00:38:03Z","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":"f093df55a7ec87f5b573d933412fa5fef7a182c11aa8b844d3b20e8a90699444","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T15:47:26Z","title_canon_sha256":"f6f40c75b60d753bc44743f13ab7546db12f3fca9a83be3d49ca27366d4ba9bf"},"schema_version":"1.0","source":{"id":"1704.04182","kind":"arxiv","version":3}},"canonical_sha256":"eb903d988b9671b37bd2c81f3e8e854950f268bfd72ae1bacdb7244f10e709d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb903d988b9671b37bd2c81f3e8e854950f268bfd72ae1bacdb7244f10e709d7","first_computed_at":"2026-05-18T00:38:03.024193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:03.024193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aCI7GqbZe9DahS+neHmXRDZODPCciD5O0uTvqXsVzHrRvqBLWaV7VTRgIb/+b8fGawTxRqGUpOY9FUExhB0wCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:03.024683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04182","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:096ab8e939c25ea34e1a18137f53c90a5837f7ac264b9bb28eafc2a091ebdbe5","sha256:fc8f37e584a621f1c54a0e71634c076e2ffb2a96d6e0037fb4271143b83fbab1"],"state_sha256":"9cb691aae35f8d639acae0723e0406bbe62f6d4694d812d4bf7bdddc76d071e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLH/2XJHCk1zGg8BstxQu+KowyftZR+wDTRPGYOdT9h+Bg7aPW7rmNdajQqR2zPuhClJrHL3D7iAk1g7M39QBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:42:28.852250Z","bundle_sha256":"fde3835a7828b0cad940d5730307e67945db186556dffda2cfaa20482375330b"}}