{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KYJLKGTJLI6LYIOIPH2A4OOKO3","short_pith_number":"pith:KYJLKGTJ","schema_version":"1.0","canonical_sha256":"5612b51a695a3cbc21c879f40e39ca76f619dcb6b9dfb9576896c94b609ecf2a","source":{"kind":"arxiv","id":"1107.2031","version":1},"attestation_state":"computed","paper":{"title":"Stegobot: construction of an unobservable communication network leveraging social behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI","physics.soc-ph"],"primary_cat":"cs.CR","authors_text":"Amir Houmansadr, Nikita Borisov, Pragya Agarwal, Pratch Piyawongwisal, Shishir Nagaraja, Vijit Singh","submitted_at":"2011-07-11T13:56:15Z","abstract_excerpt":"We propose the construction of an unobservable communications network using social networks. The communication endpoints are vertices on a social network. Probabilistically unobservable communication channels are built by leveraging image steganography and the social image sharing behavior of users. All communication takes place along the edges of a social network overlay connecting friends. We show that such a network can provide decent bandwidth even with a far from optimal routing mechanism such as restricted flooding. We show that such a network is indeed usable by constructing a botnet on"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1107.2031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-07-11T13:56:15Z","cross_cats_sorted":["cs.NI","cs.SI","physics.soc-ph"],"title_canon_sha256":"eae14a34691f25ef08313715bab74490c73eddf8716f4908a408980675bea344","abstract_canon_sha256":"e4ebb4e79f696ba64a4b6d38ff9d724299511cbbc8c7db9cc64889929a1e0213"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.965869Z","signature_b64":"Xp5yu3ZtBp6IyPzbsh27fNlt7J78PFO5xk9lcZrZCuWuLSlOu7dj48GT63V7QL5Pa3jLbONj0btgZEs2F9e3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5612b51a695a3cbc21c879f40e39ca76f619dcb6b9dfb9576896c94b609ecf2a","last_reissued_at":"2026-05-18T02:21:42.965421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.965421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stegobot: construction of an unobservable communication network leveraging social behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI","physics.soc-ph"],"primary_cat":"cs.CR","authors_text":"Amir Houmansadr, Nikita Borisov, Pragya Agarwal, Pratch Piyawongwisal, Shishir Nagaraja, Vijit Singh","submitted_at":"2011-07-11T13:56:15Z","abstract_excerpt":"We propose the construction of an unobservable communications network using social networks. The communication endpoints are vertices on a social network. Probabilistically unobservable communication channels are built by leveraging image steganography and the social image sharing behavior of users. All communication takes place along the edges of a social network overlay connecting friends. We show that such a network can provide decent bandwidth even with a far from optimal routing mechanism such as restricted flooding. We show that such a network is indeed usable by constructing a botnet on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2031","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.2031","created_at":"2026-05-18T02:21:42.965504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2031v1","created_at":"2026-05-18T02:21:42.965504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2031","created_at":"2026-05-18T02:21:42.965504+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYJLKGTJLI6L","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYJLKGTJLI6LYIOI","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYJLKGTJ","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3","json":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3.json","graph_json":"https://pith.science/api/pith-number/KYJLKGTJLI6LYIOIPH2A4OOKO3/graph.json","events_json":"https://pith.science/api/pith-number/KYJLKGTJLI6LYIOIPH2A4OOKO3/events.json","paper":"https://pith.science/paper/KYJLKGTJ"},"agent_actions":{"view_html":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3","download_json":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3.json","view_paper":"https://pith.science/paper/KYJLKGTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2031&json=true","fetch_graph":"https://pith.science/api/pith-number/KYJLKGTJLI6LYIOIPH2A4OOKO3/graph.json","fetch_events":"https://pith.science/api/pith-number/KYJLKGTJLI6LYIOIPH2A4OOKO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3/action/storage_attestation","attest_author":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3/action/author_attestation","sign_citation":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3/action/citation_signature","submit_replication":"https://pith.science/pith/KYJLKGTJLI6LYIOIPH2A4OOKO3/action/replication_record"}},"created_at":"2026-05-18T02:21:42.965504+00:00","updated_at":"2026-05-18T02:21:42.965504+00:00"}