{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BOYDFUH576FG6ZSWRHCQE7FV44","short_pith_number":"pith:BOYDFUH5","canonical_record":{"source":{"id":"1604.02526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-09T05:23:15Z","cross_cats_sorted":[],"title_canon_sha256":"fd3e2b5df6ab36da9b4ea3f6278b7bf58b76dac2ee93ca16bf80b7d7c1c7ff6b","abstract_canon_sha256":"dd5d0012b65c5765b00a64b50ad94d75aa080cc71ce2a0c1a691997cd8e1467d"},"schema_version":"1.0"},"canonical_sha256":"0bb032d0fdff8a6f665689c5027cb5e7279033c82c879688a8dc68a6c2835fa2","source":{"kind":"arxiv","id":"1604.02526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02526","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02526v1","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02526","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"BOYDFUH576FG","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BOYDFUH576FG6ZSW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BOYDFUH5","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BOYDFUH576FG6ZSWRHCQE7FV44","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-09T05:23:15Z","cross_cats_sorted":[],"title_canon_sha256":"fd3e2b5df6ab36da9b4ea3f6278b7bf58b76dac2ee93ca16bf80b7d7c1c7ff6b","abstract_canon_sha256":"dd5d0012b65c5765b00a64b50ad94d75aa080cc71ce2a0c1a691997cd8e1467d"},"schema_version":"1.0"},"canonical_sha256":"0bb032d0fdff8a6f665689c5027cb5e7279033c82c879688a8dc68a6c2835fa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:22.722184Z","signature_b64":"xjOq2TEpx13d/AVWnQb8numEfsUj1Qnzh1bmqp9FJ4rrqxvQkgkuwTIASg83IlPAJJbzBKFApeKfYArPRUmzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb032d0fdff8a6f665689c5027cb5e7279033c82c879688a8dc68a6c2835fa2","last_reissued_at":"2026-05-18T01:17:22.721797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:22.721797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02526","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-18T01:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3AX/c/fKaDkeg1VZ0D4t4fr7T7qDQHkWULGq0cFKxi1gnDp1oF2xDXiKaR73Tex1Wo9pdzYG1OYoUEQCikTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:28:17.611846Z"},"content_sha256":"d515485d55dae541c678d90a5c8ec05d4508176ad42465067143482172f7177f","schema_version":"1.0","event_id":"sha256:d515485d55dae541c678d90a5c8ec05d4508176ad42465067143482172f7177f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BOYDFUH576FG6ZSWRHCQE7FV44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Recovery Solution for Information Loss in Real-Time Network Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"ByungGuk Kim, Hengky Susanto","submitted_at":"2016-04-09T05:23:15Z","abstract_excerpt":"Feedback mechanism based algorithms are frequently used to solve network optimization problems. These schemes involve users and network exchanging information (e.g. requests for bandwidth allocation and pricing) to achieve convergence towards an optimal solution. However, in the implementation, these algorithms do not guarantee that messages will be delivered to the destination when network congestion occurs. This in turn often results in packet drops, which may cause information loss, and this condition may lead to algorithm failing to converge. To prevent this failure, we propose least squar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02526","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-18T01:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAc81dM89L8oe0lokNROXyIfhIOp5cbJ7FKgXJu40wxkf4MX3Jy+Oh86M4uxrq+55yvvHnuU6wJXF74+jQhYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:28:17.612197Z"},"content_sha256":"552643d66790cd8b9385ce68f3184b52b0c5565a98b8cfce8f5fefcafa643fd0","schema_version":"1.0","event_id":"sha256:552643d66790cd8b9385ce68f3184b52b0c5565a98b8cfce8f5fefcafa643fd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOYDFUH576FG6ZSWRHCQE7FV44/bundle.json","state_url":"https://pith.science/pith/BOYDFUH576FG6ZSWRHCQE7FV44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOYDFUH576FG6ZSWRHCQE7FV44/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-26T13:28:17Z","links":{"resolver":"https://pith.science/pith/BOYDFUH576FG6ZSWRHCQE7FV44","bundle":"https://pith.science/pith/BOYDFUH576FG6ZSWRHCQE7FV44/bundle.json","state":"https://pith.science/pith/BOYDFUH576FG6ZSWRHCQE7FV44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOYDFUH576FG6ZSWRHCQE7FV44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BOYDFUH576FG6ZSWRHCQE7FV44","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":"dd5d0012b65c5765b00a64b50ad94d75aa080cc71ce2a0c1a691997cd8e1467d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-09T05:23:15Z","title_canon_sha256":"fd3e2b5df6ab36da9b4ea3f6278b7bf58b76dac2ee93ca16bf80b7d7c1c7ff6b"},"schema_version":"1.0","source":{"id":"1604.02526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02526","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02526v1","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02526","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"BOYDFUH576FG","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BOYDFUH576FG6ZSW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BOYDFUH5","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:552643d66790cd8b9385ce68f3184b52b0c5565a98b8cfce8f5fefcafa643fd0","target":"graph","created_at":"2026-05-18T01:17:22Z","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":"Feedback mechanism based algorithms are frequently used to solve network optimization problems. These schemes involve users and network exchanging information (e.g. requests for bandwidth allocation and pricing) to achieve convergence towards an optimal solution. However, in the implementation, these algorithms do not guarantee that messages will be delivered to the destination when network congestion occurs. This in turn often results in packet drops, which may cause information loss, and this condition may lead to algorithm failing to converge. To prevent this failure, we propose least squar","authors_text":"ByungGuk Kim, Hengky Susanto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-09T05:23:15Z","title":"Practical Recovery Solution for Information Loss in Real-Time Network Environment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02526","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:d515485d55dae541c678d90a5c8ec05d4508176ad42465067143482172f7177f","target":"record","created_at":"2026-05-18T01:17:22Z","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":"dd5d0012b65c5765b00a64b50ad94d75aa080cc71ce2a0c1a691997cd8e1467d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-09T05:23:15Z","title_canon_sha256":"fd3e2b5df6ab36da9b4ea3f6278b7bf58b76dac2ee93ca16bf80b7d7c1c7ff6b"},"schema_version":"1.0","source":{"id":"1604.02526","kind":"arxiv","version":1}},"canonical_sha256":"0bb032d0fdff8a6f665689c5027cb5e7279033c82c879688a8dc68a6c2835fa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bb032d0fdff8a6f665689c5027cb5e7279033c82c879688a8dc68a6c2835fa2","first_computed_at":"2026-05-18T01:17:22.721797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:22.721797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xjOq2TEpx13d/AVWnQb8numEfsUj1Qnzh1bmqp9FJ4rrqxvQkgkuwTIASg83IlPAJJbzBKFApeKfYArPRUmzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:22.722184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d515485d55dae541c678d90a5c8ec05d4508176ad42465067143482172f7177f","sha256:552643d66790cd8b9385ce68f3184b52b0c5565a98b8cfce8f5fefcafa643fd0"],"state_sha256":"84ab10ef8177666ebd5f76ed76857ebd8be1b4bb58c9088371c4e9f85f48a6d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2KiFP+NO327y94waei5Ox1xsihEGk+kAuPAii/88L1VlznzWu9G0XInp5+UaKFNCqTA3UQElsAMGAWU1eiDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:28:17.614326Z","bundle_sha256":"fd907c7b28671e89ebc7907a2dc9f2064e05ed7b027550538b2dd630c0bea467"}}