{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:GZZXT6KQLMW2PIDLZPGPR5ATMY","short_pith_number":"pith:GZZXT6KQ","canonical_record":{"source":{"id":"1011.5015","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-23T07:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"66fac831f2290bdaf2d16ee7028fe3c8bdaec78ccd77e17ae27b4e1e62408321","abstract_canon_sha256":"f8add6690f3f50f6525c8c94b8107ae1cb790f7708e27c5ea963eb7aef80db40"},"schema_version":"1.0"},"canonical_sha256":"367379f9505b2da7a06bcbccf8f41366339394bab4106858d69f18d684af0ae0","source":{"kind":"arxiv","id":"1011.5015","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5015","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5015v2","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5015","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"GZZXT6KQLMW2","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GZZXT6KQLMW2PIDL","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GZZXT6KQ","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:GZZXT6KQLMW2PIDLZPGPR5ATMY","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5015","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-23T07:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"66fac831f2290bdaf2d16ee7028fe3c8bdaec78ccd77e17ae27b4e1e62408321","abstract_canon_sha256":"f8add6690f3f50f6525c8c94b8107ae1cb790f7708e27c5ea963eb7aef80db40"},"schema_version":"1.0"},"canonical_sha256":"367379f9505b2da7a06bcbccf8f41366339394bab4106858d69f18d684af0ae0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:47.759364Z","signature_b64":"4mkTvmU0IusGBJeXBxBEttQihkyQ0Z/RVZoNto7aCyGUgbULsZr2tUD7Ce++UVcieZ6YqIIUZxIXbIUJ/F/NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"367379f9505b2da7a06bcbccf8f41366339394bab4106858d69f18d684af0ae0","last_reissued_at":"2026-05-18T04:34:47.758769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:47.758769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5015","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-18T04:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2HKG7O69C8tNq0S6/PbBbTgdLdiI/OqbrYevyNcKHzlBCcN7PQPZaCJwlmjCWp3IsvCGQEiYy2x8PwcSXJNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T10:45:53.703307Z"},"content_sha256":"6b0e135e596d456c45742e612bf00e805a55e8fd6ccc10395fdc397d20c69311","schema_version":"1.0","event_id":"sha256:6b0e135e596d456c45742e612bf00e805a55e8fd6ccc10395fdc397d20c69311"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:GZZXT6KQLMW2PIDLZPGPR5ATMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One More Weight is Enough: Toward the Optimal Traffic Engineering with OSPF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hongying Liu, Jiangchuan Liu, Ke Xu, Meng Shen","submitted_at":"2010-11-23T07:07:47Z","abstract_excerpt":"Traffic Engineering (TE) leverages information of network traffic to generate a routing scheme optimizing the traffic distribution so as to advance network performance. However, optimize the link weights for OSPF to the offered traffic is an known NP-hard problem. In this paper, motivated by the fairness concept of congestion control, we firstly propose a new generic objective function, where various interests of providers can be extracted with different parameter settings. And then, we model the optimal TE as the utility maximization of multi-commodity flows with the generic objective functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5015","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-18T04:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6j1NC0UQbyMLwLUJHTus3x5hYrD2DMxuYpHuEk9OlnxrH5IINqDsIg9GCiwVFpCIchiNrXo7ZjN3VJxJnOlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T10:45:53.703665Z"},"content_sha256":"fe78e93aa2d6da5d56f3f15436efb306d456ff810a1dbc6de061054521d5eaa8","schema_version":"1.0","event_id":"sha256:fe78e93aa2d6da5d56f3f15436efb306d456ff810a1dbc6de061054521d5eaa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZZXT6KQLMW2PIDLZPGPR5ATMY/bundle.json","state_url":"https://pith.science/pith/GZZXT6KQLMW2PIDLZPGPR5ATMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZZXT6KQLMW2PIDLZPGPR5ATMY/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-20T10:45:53Z","links":{"resolver":"https://pith.science/pith/GZZXT6KQLMW2PIDLZPGPR5ATMY","bundle":"https://pith.science/pith/GZZXT6KQLMW2PIDLZPGPR5ATMY/bundle.json","state":"https://pith.science/pith/GZZXT6KQLMW2PIDLZPGPR5ATMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZZXT6KQLMW2PIDLZPGPR5ATMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GZZXT6KQLMW2PIDLZPGPR5ATMY","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":"f8add6690f3f50f6525c8c94b8107ae1cb790f7708e27c5ea963eb7aef80db40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-23T07:07:47Z","title_canon_sha256":"66fac831f2290bdaf2d16ee7028fe3c8bdaec78ccd77e17ae27b4e1e62408321"},"schema_version":"1.0","source":{"id":"1011.5015","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5015","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5015v2","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5015","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"GZZXT6KQLMW2","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GZZXT6KQLMW2PIDL","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GZZXT6KQ","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:fe78e93aa2d6da5d56f3f15436efb306d456ff810a1dbc6de061054521d5eaa8","target":"graph","created_at":"2026-05-18T04:34:47Z","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":"Traffic Engineering (TE) leverages information of network traffic to generate a routing scheme optimizing the traffic distribution so as to advance network performance. However, optimize the link weights for OSPF to the offered traffic is an known NP-hard problem. In this paper, motivated by the fairness concept of congestion control, we firstly propose a new generic objective function, where various interests of providers can be extracted with different parameter settings. And then, we model the optimal TE as the utility maximization of multi-commodity flows with the generic objective functio","authors_text":"Hongying Liu, Jiangchuan Liu, Ke Xu, Meng Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-23T07:07:47Z","title":"One More Weight is Enough: Toward the Optimal Traffic Engineering with OSPF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5015","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:6b0e135e596d456c45742e612bf00e805a55e8fd6ccc10395fdc397d20c69311","target":"record","created_at":"2026-05-18T04:34:47Z","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":"f8add6690f3f50f6525c8c94b8107ae1cb790f7708e27c5ea963eb7aef80db40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-23T07:07:47Z","title_canon_sha256":"66fac831f2290bdaf2d16ee7028fe3c8bdaec78ccd77e17ae27b4e1e62408321"},"schema_version":"1.0","source":{"id":"1011.5015","kind":"arxiv","version":2}},"canonical_sha256":"367379f9505b2da7a06bcbccf8f41366339394bab4106858d69f18d684af0ae0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"367379f9505b2da7a06bcbccf8f41366339394bab4106858d69f18d684af0ae0","first_computed_at":"2026-05-18T04:34:47.758769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:47.758769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4mkTvmU0IusGBJeXBxBEttQihkyQ0Z/RVZoNto7aCyGUgbULsZr2tUD7Ce++UVcieZ6YqIIUZxIXbIUJ/F/NCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:47.759364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5015","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b0e135e596d456c45742e612bf00e805a55e8fd6ccc10395fdc397d20c69311","sha256:fe78e93aa2d6da5d56f3f15436efb306d456ff810a1dbc6de061054521d5eaa8"],"state_sha256":"3e86758bc6178d0901eb379aa519051a87cc1d2c16b3b166fc7444cd1538c0ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lx0+2qFL2Syg9YHR6a7xpGUPnFzBM3HFSW3kBHw6qSYickw0pqslIfhDcW5paFqY/B9RwYj3QZhB2wBk1mMzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T10:45:53.705633Z","bundle_sha256":"bd147c0ca4f36df5f252f9d3467c3ae6661e8ea1c94470d2ff1320288eab64f8"}}