{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HC57EJNQQRAS5VLC4S6ADYQ5OY","short_pith_number":"pith:HC57EJNQ","canonical_record":{"source":{"id":"1311.3226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T17:37:01Z","cross_cats_sorted":[],"title_canon_sha256":"f8c402ba8e59160987476bf0798d194bb107be777c714bb0935e25be6a2b5c13","abstract_canon_sha256":"32521d1bf72f6d7812e7bafa8f21ede72633e66a88556554f17ef3a44406c7eb"},"schema_version":"1.0"},"canonical_sha256":"38bbf225b084412ed562e4bc01e21d761e83a0b4c6d480a76de3e361ae5b4582","source":{"kind":"arxiv","id":"1311.3226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3226","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3226v1","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3226","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"pith_short_12","alias_value":"HC57EJNQQRAS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HC57EJNQQRAS5VLC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HC57EJNQ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HC57EJNQQRAS5VLC4S6ADYQ5OY","target":"record","payload":{"canonical_record":{"source":{"id":"1311.3226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T17:37:01Z","cross_cats_sorted":[],"title_canon_sha256":"f8c402ba8e59160987476bf0798d194bb107be777c714bb0935e25be6a2b5c13","abstract_canon_sha256":"32521d1bf72f6d7812e7bafa8f21ede72633e66a88556554f17ef3a44406c7eb"},"schema_version":"1.0"},"canonical_sha256":"38bbf225b084412ed562e4bc01e21d761e83a0b4c6d480a76de3e361ae5b4582","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:12.665703Z","signature_b64":"6JnAEu8buC0678nQm4Kddy5/KbouHt4e3eZW3bPsCH42yuYKxhUBAOD5JuOx0ZUwdrNlU+2ESZDbAnLthFiKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38bbf225b084412ed562e4bc01e21d761e83a0b4c6d480a76de3e361ae5b4582","last_reissued_at":"2026-05-18T03:07:12.664885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:12.664885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.3226","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-18T03:07:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QENFW02JSitA5E213WrbsZSfbbEs1Be38OiYKtztu8EopIf6lb7ysIt9phc8MMSYj4RREZSsNqFz1DaoIaYMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:32:45.073444Z"},"content_sha256":"568423b4e1fbec046e64173f71364c4cf1385cc4d8c8b70b46969b31a0fc9f92","schema_version":"1.0","event_id":"sha256:568423b4e1fbec046e64173f71364c4cf1385cc4d8c8b70b46969b31a0fc9f92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HC57EJNQQRAS5VLC4S6ADYQ5OY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Social Information for Flow Allocation in MANETs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amit Pande, Andrew Clark, Kannan Govindan, Prasant Mohapatra, Radha Poovendran","submitted_at":"2013-11-13T17:37:01Z","abstract_excerpt":"Adhoc networks enable communication between distributed, mobile wireless nodes without any supporting infrastructure. In the absence of centralized control, such networks require node interaction, and are inherently based on cooperation between nodes. In this paper, we use social and behavioral trust of nodes to form a flow allocation optimization problem. We initialize trust using information gained from users' social relationships (from social networks) and update the trusts metric over time based on observed node behaviors. We conduct analysis of social trust using real data sets and used i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3226","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-18T03:07:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3aBLc+2yjsfd8keG7QdbYmfJvgG+WRtsz//HLgEu30Epg/+L+AQwMk4FCIxKuF/bOTmQKAR2diM2zVSP2at4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:32:45.073830Z"},"content_sha256":"2b55a414d86aa0f3562d2c23259f1845d9684bb3f0a6c4ed72f99674d31a6bf6","schema_version":"1.0","event_id":"sha256:2b55a414d86aa0f3562d2c23259f1845d9684bb3f0a6c4ed72f99674d31a6bf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HC57EJNQQRAS5VLC4S6ADYQ5OY/bundle.json","state_url":"https://pith.science/pith/HC57EJNQQRAS5VLC4S6ADYQ5OY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HC57EJNQQRAS5VLC4S6ADYQ5OY/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-30T19:32:45Z","links":{"resolver":"https://pith.science/pith/HC57EJNQQRAS5VLC4S6ADYQ5OY","bundle":"https://pith.science/pith/HC57EJNQQRAS5VLC4S6ADYQ5OY/bundle.json","state":"https://pith.science/pith/HC57EJNQQRAS5VLC4S6ADYQ5OY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HC57EJNQQRAS5VLC4S6ADYQ5OY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HC57EJNQQRAS5VLC4S6ADYQ5OY","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":"32521d1bf72f6d7812e7bafa8f21ede72633e66a88556554f17ef3a44406c7eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T17:37:01Z","title_canon_sha256":"f8c402ba8e59160987476bf0798d194bb107be777c714bb0935e25be6a2b5c13"},"schema_version":"1.0","source":{"id":"1311.3226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3226","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3226v1","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3226","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"pith_short_12","alias_value":"HC57EJNQQRAS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HC57EJNQQRAS5VLC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HC57EJNQ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:2b55a414d86aa0f3562d2c23259f1845d9684bb3f0a6c4ed72f99674d31a6bf6","target":"graph","created_at":"2026-05-18T03:07:12Z","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":"Adhoc networks enable communication between distributed, mobile wireless nodes without any supporting infrastructure. In the absence of centralized control, such networks require node interaction, and are inherently based on cooperation between nodes. In this paper, we use social and behavioral trust of nodes to form a flow allocation optimization problem. We initialize trust using information gained from users' social relationships (from social networks) and update the trusts metric over time based on observed node behaviors. We conduct analysis of social trust using real data sets and used i","authors_text":"Amit Pande, Andrew Clark, Kannan Govindan, Prasant Mohapatra, Radha Poovendran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T17:37:01Z","title":"Using Social Information for Flow Allocation in MANETs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3226","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:568423b4e1fbec046e64173f71364c4cf1385cc4d8c8b70b46969b31a0fc9f92","target":"record","created_at":"2026-05-18T03:07:12Z","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":"32521d1bf72f6d7812e7bafa8f21ede72633e66a88556554f17ef3a44406c7eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T17:37:01Z","title_canon_sha256":"f8c402ba8e59160987476bf0798d194bb107be777c714bb0935e25be6a2b5c13"},"schema_version":"1.0","source":{"id":"1311.3226","kind":"arxiv","version":1}},"canonical_sha256":"38bbf225b084412ed562e4bc01e21d761e83a0b4c6d480a76de3e361ae5b4582","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38bbf225b084412ed562e4bc01e21d761e83a0b4c6d480a76de3e361ae5b4582","first_computed_at":"2026-05-18T03:07:12.664885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:12.664885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6JnAEu8buC0678nQm4Kddy5/KbouHt4e3eZW3bPsCH42yuYKxhUBAOD5JuOx0ZUwdrNlU+2ESZDbAnLthFiKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:12.665703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:568423b4e1fbec046e64173f71364c4cf1385cc4d8c8b70b46969b31a0fc9f92","sha256:2b55a414d86aa0f3562d2c23259f1845d9684bb3f0a6c4ed72f99674d31a6bf6"],"state_sha256":"49e3d444aba475379ff586dec7978674dfd268f5bd0dd6b3cfd077c8903263d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWAfrbOBeoe3S25DBsq4FKrJeUeeHv6B6ocCxpcuqqOGWkcmhke/2uja5kdbpwwPpud1joc9vOoLOFCmD52UCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:32:45.075906Z","bundle_sha256":"ad33ab967e32a4e9d089bea548724dfed496ed89fb19b6475f633a7c4b916a76"}}