{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NEEWMFM2BIXPPRXVV3ILR5OOF3","short_pith_number":"pith:NEEWMFM2","canonical_record":{"source":{"id":"1011.2246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-10T01:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"c2f35b6633bb45c757fe31c331ba55dec5394acf4a16b03fca2caa2e0ccccc30","abstract_canon_sha256":"9d5178d5a34fac006f7c19bb404bcc3c5be8c080b4cc7dafb80dd39df112d7e5"},"schema_version":"1.0"},"canonical_sha256":"690966159a0a2ef7c6f5aed0b8f5ce2ec7d2aa158ed5c8cf9227416d92077e53","source":{"kind":"arxiv","id":"1011.2246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2246","created_at":"2026-05-18T04:36:30Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2246v1","created_at":"2026-05-18T04:36:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2246","created_at":"2026-05-18T04:36:30Z"},{"alias_kind":"pith_short_12","alias_value":"NEEWMFM2BIXP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NEEWMFM2BIXPPRXV","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NEEWMFM2","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NEEWMFM2BIXPPRXVV3ILR5OOF3","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-10T01:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"c2f35b6633bb45c757fe31c331ba55dec5394acf4a16b03fca2caa2e0ccccc30","abstract_canon_sha256":"9d5178d5a34fac006f7c19bb404bcc3c5be8c080b4cc7dafb80dd39df112d7e5"},"schema_version":"1.0"},"canonical_sha256":"690966159a0a2ef7c6f5aed0b8f5ce2ec7d2aa158ed5c8cf9227416d92077e53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:30.761652Z","signature_b64":"VQ36YYzZ/ERHoC6I1Rx2m0J1fZa/3ZesAwH/0lTO4Duw2mAk8vzpCMJHUfWPZPDkrGiArynn2KU/9DzET7LhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690966159a0a2ef7c6f5aed0b8f5ce2ec7d2aa158ed5c8cf9227416d92077e53","last_reissued_at":"2026-05-18T04:36:30.761080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:30.761080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2246","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-18T04:36:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDxvVhccdgOFsKikFlZmadlq0g5imoRBnNpjyj78GIklonJBkAepcDVwoE/KxSXqut7naUmlszUUAw7jOM+tCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:43:22.208160Z"},"content_sha256":"24e4a8a0a3db96ca37d961d0fb8faf5d46d89bf7c07c0284159f2e29ec7d697b","schema_version":"1.0","event_id":"sha256:24e4a8a0a3db96ca37d961d0fb8faf5d46d89bf7c07c0284159f2e29ec7d697b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NEEWMFM2BIXPPRXVV3ILR5OOF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"p-Norm Flow Optimization in a Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Mehdi Kalantari, Sina Zahedpour","submitted_at":"2010-11-10T01:22:46Z","abstract_excerpt":"In this paper we study information flow paths in a data network, where traffic generated by servers (or sources) takes a multi-hop path in order to reach its clients (destinations). Each node in the middle of this multi-hop path should route the incoming traffic and the traffic generated by itself to the next hop in such a way that the traffic reaches its destination while avoiding congestion in the links. For simplicity, we will assume the network only carries single commodity traffic, i.e., all of the traffic should be routed to a single destination."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2246","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-18T04:36:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZkG5S8VZ/1kb909w/XCnxqtkweszgENoKZo62V+XJphkM3eZevFAFQb9vOnXaTOPj9ij3hRn1xVmJaE949bCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:43:22.208510Z"},"content_sha256":"151f8b343e49d433ba42607c45e006cb95115ab2d4bf6c696c990c78b2a9eaaf","schema_version":"1.0","event_id":"sha256:151f8b343e49d433ba42607c45e006cb95115ab2d4bf6c696c990c78b2a9eaaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEEWMFM2BIXPPRXVV3ILR5OOF3/bundle.json","state_url":"https://pith.science/pith/NEEWMFM2BIXPPRXVV3ILR5OOF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEEWMFM2BIXPPRXVV3ILR5OOF3/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-21T09:43:22Z","links":{"resolver":"https://pith.science/pith/NEEWMFM2BIXPPRXVV3ILR5OOF3","bundle":"https://pith.science/pith/NEEWMFM2BIXPPRXVV3ILR5OOF3/bundle.json","state":"https://pith.science/pith/NEEWMFM2BIXPPRXVV3ILR5OOF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEEWMFM2BIXPPRXVV3ILR5OOF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NEEWMFM2BIXPPRXVV3ILR5OOF3","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":"9d5178d5a34fac006f7c19bb404bcc3c5be8c080b4cc7dafb80dd39df112d7e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-10T01:22:46Z","title_canon_sha256":"c2f35b6633bb45c757fe31c331ba55dec5394acf4a16b03fca2caa2e0ccccc30"},"schema_version":"1.0","source":{"id":"1011.2246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2246","created_at":"2026-05-18T04:36:30Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2246v1","created_at":"2026-05-18T04:36:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2246","created_at":"2026-05-18T04:36:30Z"},{"alias_kind":"pith_short_12","alias_value":"NEEWMFM2BIXP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NEEWMFM2BIXPPRXV","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NEEWMFM2","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:151f8b343e49d433ba42607c45e006cb95115ab2d4bf6c696c990c78b2a9eaaf","target":"graph","created_at":"2026-05-18T04:36:30Z","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":"In this paper we study information flow paths in a data network, where traffic generated by servers (or sources) takes a multi-hop path in order to reach its clients (destinations). Each node in the middle of this multi-hop path should route the incoming traffic and the traffic generated by itself to the next hop in such a way that the traffic reaches its destination while avoiding congestion in the links. For simplicity, we will assume the network only carries single commodity traffic, i.e., all of the traffic should be routed to a single destination.","authors_text":"Mehdi Kalantari, Sina Zahedpour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-10T01:22:46Z","title":"p-Norm Flow Optimization in a Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2246","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:24e4a8a0a3db96ca37d961d0fb8faf5d46d89bf7c07c0284159f2e29ec7d697b","target":"record","created_at":"2026-05-18T04:36:30Z","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":"9d5178d5a34fac006f7c19bb404bcc3c5be8c080b4cc7dafb80dd39df112d7e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-10T01:22:46Z","title_canon_sha256":"c2f35b6633bb45c757fe31c331ba55dec5394acf4a16b03fca2caa2e0ccccc30"},"schema_version":"1.0","source":{"id":"1011.2246","kind":"arxiv","version":1}},"canonical_sha256":"690966159a0a2ef7c6f5aed0b8f5ce2ec7d2aa158ed5c8cf9227416d92077e53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"690966159a0a2ef7c6f5aed0b8f5ce2ec7d2aa158ed5c8cf9227416d92077e53","first_computed_at":"2026-05-18T04:36:30.761080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:30.761080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VQ36YYzZ/ERHoC6I1Rx2m0J1fZa/3ZesAwH/0lTO4Duw2mAk8vzpCMJHUfWPZPDkrGiArynn2KU/9DzET7LhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:30.761652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24e4a8a0a3db96ca37d961d0fb8faf5d46d89bf7c07c0284159f2e29ec7d697b","sha256:151f8b343e49d433ba42607c45e006cb95115ab2d4bf6c696c990c78b2a9eaaf"],"state_sha256":"6bae8975c80c8730d7933a8572aa9aae86aa6d33eaa7bbfdb87b8c304bfff389"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iN/Y+3ty7Nqq6NjDFJ3IaiFG7w5B0+0D5psJc1CFlP0WNk4fcNOZ3hq7IVouB2SLAkcaIoSNyTl7s4/8UvxaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T09:43:22.210329Z","bundle_sha256":"e2452a22de236407237f318e504ac5a5deb3ba59d1b19e737118739534564bb0"}}