{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PKJKRPCZHWMLWNBZSG2WZUWPFE","short_pith_number":"pith:PKJKRPCZ","schema_version":"1.0","canonical_sha256":"7a92a8bc593d98bb343991b56cd2cf2935b6ab7f32bf60351eb32b04e865865a","source":{"kind":"arxiv","id":"1806.01581","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.01581","created_at":"2026-05-18T00:14:12.357976+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01581v1","created_at":"2026-05-18T00:14:12.357976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01581","created_at":"2026-05-18T00:14:12.357976+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKJKRPCZHWML","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKJKRPCZHWMLWNBZ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKJKRPCZ","created_at":"2026-05-18T12:32:46.962924+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/PKJKRPCZHWMLWNBZSG2WZUWPFE","json":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE.json","graph_json":"https://pith.science/api/pith-number/PKJKRPCZHWMLWNBZSG2WZUWPFE/graph.json","events_json":"https://pith.science/api/pith-number/PKJKRPCZHWMLWNBZSG2WZUWPFE/events.json","paper":"https://pith.science/paper/PKJKRPCZ"},"agent_actions":{"view_html":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE","download_json":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE.json","view_paper":"https://pith.science/paper/PKJKRPCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01581&json=true","fetch_graph":"https://pith.science/api/pith-number/PKJKRPCZHWMLWNBZSG2WZUWPFE/graph.json","fetch_events":"https://pith.science/api/pith-number/PKJKRPCZHWMLWNBZSG2WZUWPFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/action/storage_attestation","attest_author":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/action/author_attestation","sign_citation":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/action/citation_signature","submit_replication":"https://pith.science/pith/PKJKRPCZHWMLWNBZSG2WZUWPFE/action/replication_record"}},"created_at":"2026-05-18T00:14:12.357976+00:00","updated_at":"2026-05-18T00:14:12.357976+00:00"}