{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PKJKRPCZHWMLWNBZSG2WZUWPFE","short_pith_number":"pith:PKJKRPCZ","canonical_record":{"source":{"id":"1806.01581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T09:38:34Z","cross_cats_sorted":[],"title_canon_sha256":"a0524a5935eb3fa820800ccefeed37a703c6b2d6e0c1ed3603a3956ab8b4d208","abstract_canon_sha256":"7f4eaa830f06d2d9d386609feaa6841c1a17efa6c515232b406bb6b7fa2a9415"},"schema_version":"1.0"},"canonical_sha256":"7a92a8bc593d98bb343991b56cd2cf2935b6ab7f32bf60351eb32b04e865865a","source":{"kind":"arxiv","id":"1806.01581","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01581","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01581v1","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01581","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"PKJKRPCZHWML","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PKJKRPCZHWMLWNBZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PKJKRPCZ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PKJKRPCZHWMLWNBZSG2WZUWPFE","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T09:38:34Z","cross_cats_sorted":[],"title_canon_sha256":"a0524a5935eb3fa820800ccefeed37a703c6b2d6e0c1ed3603a3956ab8b4d208","abstract_canon_sha256":"7f4eaa830f06d2d9d386609feaa6841c1a17efa6c515232b406bb6b7fa2a9415"},"schema_version":"1.0"},"canonical_sha256":"7a92a8bc593d98bb343991b56cd2cf2935b6ab7f32bf60351eb32b04e865865a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:12.358593Z","signature_b64":"Rqp+ta51r1S7QEdRF383RDj1ogF6akWdiuxOT9zD9UBuNL6ITc3zGOTvCYSau7letzl128oAM4wLaBvGLwR6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a92a8bc593d98bb343991b56cd2cf2935b6ab7f32bf60351eb32b04e865865a","last_reissued_at":"2026-05-18T00:14:12.357874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:12.357874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01581","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-18T00:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDtwvQLK7l/kTlNxkoSCiqsxq2qB3vKCVRAR5QRzFpfhX33o2TV00TpVx3jXkNtK1a4VK0B9s1fd76G3rJ0/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:01:42.488874Z"},"content_sha256":"0a819cecae0f4f7c7b9828ae9aa114fbe9ebc0e24b0e0d81a1288d8a60f6ce63","schema_version":"1.0","event_id":"sha256:0a819cecae0f4f7c7b9828ae9aa114fbe9ebc0e24b0e0d81a1288d8a60f6ce63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PKJKRPCZHWMLWNBZSG2WZUWPFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Programming Optimization in Line of Sight Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michele Zito, Pavan Sangha, Prudence W. H. Wong","submitted_at":"2018-06-05T09:38:34Z","abstract_excerpt":"Line of Sight (LoS) networks were designed to model wireless communication in settings which may contain obstacles restricting node visibility. For fixed positive integer $d$, and positive integer $\\omega$, a graph $G=(V,E)$ is a ($d$-dimensional) LoS network with range parameter $\\omega$ if it can be embedded in a cube of side size $n$ of the $d$-dimensional integer grid so that each pair of vertices in $V$ are adjacent if and only if their embedding coordinates differ only in one position and such difference is less than $\\omega$.\n  In this paper we investigate a dynamic programming (DP) app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01581","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-18T00:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2TaS7uOIeE8PKFiMwamQYlP8mCTwTu+CCzim2J2WROAV68Jdu/Cnizn2fk9ZtnktfNg8EmZVfJssDj2io8kDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:01:42.489310Z"},"content_sha256":"41745cc956a4997c47c7d143a43ddd64583abf9c3dbbafc54e0ac82b34937544","schema_version":"1.0","event_id":"sha256:41745cc956a4997c47c7d143a43ddd64583abf9c3dbbafc54e0ac82b34937544"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/bundle.json","state_url":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/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-22T03:01:42Z","links":{"resolver":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE","bundle":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/bundle.json","state":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PKJKRPCZHWMLWNBZSG2WZUWPFE","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":"7f4eaa830f06d2d9d386609feaa6841c1a17efa6c515232b406bb6b7fa2a9415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T09:38:34Z","title_canon_sha256":"a0524a5935eb3fa820800ccefeed37a703c6b2d6e0c1ed3603a3956ab8b4d208"},"schema_version":"1.0","source":{"id":"1806.01581","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01581","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01581v1","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01581","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"PKJKRPCZHWML","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PKJKRPCZHWMLWNBZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PKJKRPCZ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:41745cc956a4997c47c7d143a43ddd64583abf9c3dbbafc54e0ac82b34937544","target":"graph","created_at":"2026-05-18T00:14: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":"Line of Sight (LoS) networks were designed to model wireless communication in settings which may contain obstacles restricting node visibility. For fixed positive integer $d$, and positive integer $\\omega$, a graph $G=(V,E)$ is a ($d$-dimensional) LoS network with range parameter $\\omega$ if it can be embedded in a cube of side size $n$ of the $d$-dimensional integer grid so that each pair of vertices in $V$ are adjacent if and only if their embedding coordinates differ only in one position and such difference is less than $\\omega$.\n  In this paper we investigate a dynamic programming (DP) app","authors_text":"Michele Zito, Pavan Sangha, Prudence W. H. Wong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T09:38:34Z","title":"Dynamic Programming Optimization in Line of Sight Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01581","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:0a819cecae0f4f7c7b9828ae9aa114fbe9ebc0e24b0e0d81a1288d8a60f6ce63","target":"record","created_at":"2026-05-18T00:14: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":"7f4eaa830f06d2d9d386609feaa6841c1a17efa6c515232b406bb6b7fa2a9415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T09:38:34Z","title_canon_sha256":"a0524a5935eb3fa820800ccefeed37a703c6b2d6e0c1ed3603a3956ab8b4d208"},"schema_version":"1.0","source":{"id":"1806.01581","kind":"arxiv","version":1}},"canonical_sha256":"7a92a8bc593d98bb343991b56cd2cf2935b6ab7f32bf60351eb32b04e865865a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a92a8bc593d98bb343991b56cd2cf2935b6ab7f32bf60351eb32b04e865865a","first_computed_at":"2026-05-18T00:14:12.357874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:12.357874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rqp+ta51r1S7QEdRF383RDj1ogF6akWdiuxOT9zD9UBuNL6ITc3zGOTvCYSau7letzl128oAM4wLaBvGLwR6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:12.358593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01581","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a819cecae0f4f7c7b9828ae9aa114fbe9ebc0e24b0e0d81a1288d8a60f6ce63","sha256:41745cc956a4997c47c7d143a43ddd64583abf9c3dbbafc54e0ac82b34937544"],"state_sha256":"8407bf5875c1fff70205f3294706b80b9e24bcdeaa220e3cfffa3c5667a8e027"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHbIk91QPhTv/5uA3bzYu2BCzm0rUc950yx4LA09uXX1Y+iv7zxdg5UV7PXw3g5m37BUcS1IdWhVEJsOhJ6bDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T03:01:42.491717Z","bundle_sha256":"9cb0ef95bc7b11c35a0266eeaf381dfe0f69e192cb89cb0b73d705a8906fd446"}}