{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4UU45DSNK7BZPEW6XPJP436YHP","short_pith_number":"pith:4UU45DSN","schema_version":"1.0","canonical_sha256":"e529ce8e4d57c39792debbd2fe6fd83be6b2fdbb7ba0bee7aa3cd7fbc1d9d541","source":{"kind":"arxiv","id":"1111.6149","version":1},"attestation_state":"computed","paper":{"title":"Optimal Organizational Hierarchies: Source Coding: Disaster Relief","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"G. Rama Murthy","submitted_at":"2011-11-26T10:29:08Z","abstract_excerpt":"ulticasting is an important communication paradigm for enabling the dissemination of information selectively. This paper considers the problem of optimal secure multicasting in a communication network captured through a graph (optimal is in an interesting sense) and provides a doubly optimal solution using results from source coding. It is realized that the solution leads to optimal design (in a well defined optimality sense) of organizational hierarchies captured through a graph. In this effort two novel concepts : prefix free path, graph entropy are introduced. Some results of graph entropy "},"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":"1111.6149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-26T10:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"9759728bb68f2a157749e9141a1572d36204789409696809e95f199048a49c46","abstract_canon_sha256":"8649ccfe86fc4f8b68e0bc5cc81968e0063a97dbf24f8336b771ad49a57efaff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:31.697855Z","signature_b64":"JUF65iSQ3Q4++mNOK1x+F01me5z8uTD5/0Sj3XcEiBkKbBmzcsyKbFxg5wqFvoE4Lp/SyBC3s/tQ/dZ4KP9JAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e529ce8e4d57c39792debbd2fe6fd83be6b2fdbb7ba0bee7aa3cd7fbc1d9d541","last_reissued_at":"2026-05-18T04:07:31.697143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:31.697143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Organizational Hierarchies: Source Coding: Disaster Relief","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"G. Rama Murthy","submitted_at":"2011-11-26T10:29:08Z","abstract_excerpt":"ulticasting is an important communication paradigm for enabling the dissemination of information selectively. This paper considers the problem of optimal secure multicasting in a communication network captured through a graph (optimal is in an interesting sense) and provides a doubly optimal solution using results from source coding. It is realized that the solution leads to optimal design (in a well defined optimality sense) of organizational hierarchies captured through a graph. In this effort two novel concepts : prefix free path, graph entropy are introduced. Some results of graph entropy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6149","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":"1111.6149","created_at":"2026-05-18T04:07:31.697262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.6149v1","created_at":"2026-05-18T04:07:31.697262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6149","created_at":"2026-05-18T04:07:31.697262+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UU45DSNK7BZ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UU45DSNK7BZPEW6","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UU45DSN","created_at":"2026-05-18T12:26:20.644004+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/4UU45DSNK7BZPEW6XPJP436YHP","json":"https://pith.science/pith/4UU45DSNK7BZPEW6XPJP436YHP.json","graph_json":"https://pith.science/api/pith-number/4UU45DSNK7BZPEW6XPJP436YHP/graph.json","events_json":"https://pith.science/api/pith-number/4UU45DSNK7BZPEW6XPJP436YHP/events.json","paper":"https://pith.science/paper/4UU45DSN"},"agent_actions":{"view_html":"https://pith.science/pith/4UU45DSNK7BZPEW6XPJP436YHP","download_json":"https://pith.science/pith/4UU45DSNK7BZPEW6XPJP436YHP.json","view_paper":"https://pith.science/paper/4UU45DSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.6149&json=true","fetch_graph":"https://pith.science/api/pith-number/4UU45DSNK7BZPEW6XPJP436YHP/graph.json","fetch_events":"https://pith.science/api/pith-number/4UU45DSNK7BZPEW6XPJP436YHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UU45DSNK7BZPEW6XPJP436YHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UU45DSNK7BZPEW6XPJP436YHP/action/storage_attestation","attest_author":"https://pith.science/pith/4UU45DSNK7BZPEW6XPJP436YHP/action/author_attestation","sign_citation":"https://pith.science/pith/4UU45DSNK7BZPEW6XPJP436YHP/action/citation_signature","submit_replication":"https://pith.science/pith/4UU45DSNK7BZPEW6XPJP436YHP/action/replication_record"}},"created_at":"2026-05-18T04:07:31.697262+00:00","updated_at":"2026-05-18T04:07:31.697262+00:00"}