{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6IKN7IT4CGXNCLD3VZL2VEDRVZ","short_pith_number":"pith:6IKN7IT4","canonical_record":{"source":{"id":"1201.0423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-02T05:43:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14c26f40f28091984a90bc39437efff62fc5b45a7149adc95887565aaa22f4a9","abstract_canon_sha256":"f70d75da5518aed5edc01b11f03bc5f89116359c03c98b3fab50998789fbaafd"},"schema_version":"1.0"},"canonical_sha256":"f214dfa27c11aed12c7bae57aa9071ae5859ce613af2e9e7e11093c94a99d348","source":{"kind":"arxiv","id":"1201.0423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0423","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0423v1","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0423","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"6IKN7IT4CGXN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6IKN7IT4CGXNCLD3","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6IKN7IT4","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6IKN7IT4CGXNCLD3VZL2VEDRVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-02T05:43:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14c26f40f28091984a90bc39437efff62fc5b45a7149adc95887565aaa22f4a9","abstract_canon_sha256":"f70d75da5518aed5edc01b11f03bc5f89116359c03c98b3fab50998789fbaafd"},"schema_version":"1.0"},"canonical_sha256":"f214dfa27c11aed12c7bae57aa9071ae5859ce613af2e9e7e11093c94a99d348","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:17.562615Z","signature_b64":"RMOgAQqYeUddbpV9QaZZ+WaVIhvgLp+kyC1hoaO5ywbqU2XgTYH5j0EHXpK3AiPtM3nSVR8MAiS0pJGa0SvnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f214dfa27c11aed12c7bae57aa9071ae5859ce613af2e9e7e11093c94a99d348","last_reissued_at":"2026-05-18T04:05:17.562103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:17.562103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0423","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:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpzS/BXy8Muy8wdIy+9oeNaQVdtXw6z0B7r9+SCP3cOjrBi64VFWECeaMhU6IySQH26NjAWqGnaGMwrbtlRpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:55:06.555938Z"},"content_sha256":"5f36145bee6859d95ffb31def3a434671cab9a93bc34c6bbf566ddf422e2f19d","schema_version":"1.0","event_id":"sha256:5f36145bee6859d95ffb31def3a434671cab9a93bc34c6bbf566ddf422e2f19d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6IKN7IT4CGXNCLD3VZL2VEDRVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference-Aware Scheduling for Connectivity in MIMO Ad Hoc Multicast Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Lee Swindlehurst, Feng Jiang, Jianqi Wang","submitted_at":"2012-01-02T05:43:27Z","abstract_excerpt":"We consider a multicast scenario involving an ad hoc network of co-channel MIMO nodes in which a source node attempts to share a streaming message with all nodes in the network via some pre-defined multi-hop routing tree. The message is assumed to be broken down into packets, and the transmission is conducted over multiple frames. Each frame is divided into time slots, and each link in the routing tree is assigned one time slot in which to transmit its current packet. We present an algorithm for determining the number of time slots and the scheduling of the links in these time slots in order t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0423","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:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gwsi9fzn0iKWy3y/XjM2afSZnd7oQ6V8ukoh9arfqViGT+w9DPGJKHTioCBUCCdqVqjZ9SKFLqDDbITbPwd6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:55:06.556573Z"},"content_sha256":"9fa9b4849cd58350222a36b7939617d38668408f45c9a6a4e026d46ac665df61","schema_version":"1.0","event_id":"sha256:9fa9b4849cd58350222a36b7939617d38668408f45c9a6a4e026d46ac665df61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IKN7IT4CGXNCLD3VZL2VEDRVZ/bundle.json","state_url":"https://pith.science/pith/6IKN7IT4CGXNCLD3VZL2VEDRVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IKN7IT4CGXNCLD3VZL2VEDRVZ/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-05T03:55:06Z","links":{"resolver":"https://pith.science/pith/6IKN7IT4CGXNCLD3VZL2VEDRVZ","bundle":"https://pith.science/pith/6IKN7IT4CGXNCLD3VZL2VEDRVZ/bundle.json","state":"https://pith.science/pith/6IKN7IT4CGXNCLD3VZL2VEDRVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IKN7IT4CGXNCLD3VZL2VEDRVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6IKN7IT4CGXNCLD3VZL2VEDRVZ","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":"f70d75da5518aed5edc01b11f03bc5f89116359c03c98b3fab50998789fbaafd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-02T05:43:27Z","title_canon_sha256":"14c26f40f28091984a90bc39437efff62fc5b45a7149adc95887565aaa22f4a9"},"schema_version":"1.0","source":{"id":"1201.0423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0423","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0423v1","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0423","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"6IKN7IT4CGXN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6IKN7IT4CGXNCLD3","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6IKN7IT4","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:9fa9b4849cd58350222a36b7939617d38668408f45c9a6a4e026d46ac665df61","target":"graph","created_at":"2026-05-18T04:05:17Z","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":"We consider a multicast scenario involving an ad hoc network of co-channel MIMO nodes in which a source node attempts to share a streaming message with all nodes in the network via some pre-defined multi-hop routing tree. The message is assumed to be broken down into packets, and the transmission is conducted over multiple frames. Each frame is divided into time slots, and each link in the routing tree is assigned one time slot in which to transmit its current packet. We present an algorithm for determining the number of time slots and the scheduling of the links in these time slots in order t","authors_text":"A. Lee Swindlehurst, Feng Jiang, Jianqi Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-02T05:43:27Z","title":"Interference-Aware Scheduling for Connectivity in MIMO Ad Hoc Multicast Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0423","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:5f36145bee6859d95ffb31def3a434671cab9a93bc34c6bbf566ddf422e2f19d","target":"record","created_at":"2026-05-18T04:05:17Z","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":"f70d75da5518aed5edc01b11f03bc5f89116359c03c98b3fab50998789fbaafd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-02T05:43:27Z","title_canon_sha256":"14c26f40f28091984a90bc39437efff62fc5b45a7149adc95887565aaa22f4a9"},"schema_version":"1.0","source":{"id":"1201.0423","kind":"arxiv","version":1}},"canonical_sha256":"f214dfa27c11aed12c7bae57aa9071ae5859ce613af2e9e7e11093c94a99d348","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f214dfa27c11aed12c7bae57aa9071ae5859ce613af2e9e7e11093c94a99d348","first_computed_at":"2026-05-18T04:05:17.562103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:17.562103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RMOgAQqYeUddbpV9QaZZ+WaVIhvgLp+kyC1hoaO5ywbqU2XgTYH5j0EHXpK3AiPtM3nSVR8MAiS0pJGa0SvnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:17.562615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f36145bee6859d95ffb31def3a434671cab9a93bc34c6bbf566ddf422e2f19d","sha256:9fa9b4849cd58350222a36b7939617d38668408f45c9a6a4e026d46ac665df61"],"state_sha256":"00666ba59be08aac2d8922edbeac22d21d202b7ed44589ca80a6769210b88b70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11QIKzJ9f9+u5xXSmbE74uamgrwl1s01PFHf18RGgLuGCwTaoJSfT3C+Djf002xtecKd46ctSLjAQ21FaaX2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:55:06.560572Z","bundle_sha256":"d0416952c4e1aa6d736323178e5a66bcce96d7656172c5ca6636f936f41ca007"}}