{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3DZWVXOOAYOF2OTCEASLGNYIUD","short_pith_number":"pith:3DZWVXOO","schema_version":"1.0","canonical_sha256":"d8f36addce061c5d3a622024b33708a0d1673d7b05c17d826dc8565b5297c0c8","source":{"kind":"arxiv","id":"1304.4320","version":2},"attestation_state":"computed","paper":{"title":"An Algorithm for Computing Constrained Reflection Paths in Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arijit Bishnu, Partha Pratim Goswami, Subir Kumar Ghosh, Sudebkumar Prasant Pal, Swami Sarvattomananda","submitted_at":"2013-04-16T03:31:05Z","abstract_excerpt":"Let $s$ be a source point and $t$ be a destination point inside an $n$-vertex simple polygon $P$. Euclidean shortest paths and minimum-link paths between $s$ and $t$ inside $P$ have been well studied. Both these kinds of paths are simple and piecewise-convex. However, computing optimal paths in the context of diffuse or specular reflections does not seem to be an easy task. A path from a light source $s$ to $t$ inside $P$ is called a diffuse reflection path if the turning points of the path lie in the interiors of the boundary edges of $P$. A diffuse reflection path is said to be optimal if it"},"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":"1304.4320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-16T03:31:05Z","cross_cats_sorted":[],"title_canon_sha256":"c34465b2ef09a8c92587bd3648416817def8d6a5ac78dd97107d89f0bdacfa26","abstract_canon_sha256":"672394d12d67ad2b559ad7349c619acfcd56f43a39c80df5fa05951429bf8383"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.612934Z","signature_b64":"fRsRqkZsppNFi3ZxCcAggV57EkkkZ2005HGJ+pqWG5X9Bkz0p54rC+TnkX/23lJ+9kYcm6CNrOH45tz0pX3XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8f36addce061c5d3a622024b33708a0d1673d7b05c17d826dc8565b5297c0c8","last_reissued_at":"2026-05-18T02:52:49.612537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.612537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Computing Constrained Reflection Paths in Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arijit Bishnu, Partha Pratim Goswami, Subir Kumar Ghosh, Sudebkumar Prasant Pal, Swami Sarvattomananda","submitted_at":"2013-04-16T03:31:05Z","abstract_excerpt":"Let $s$ be a source point and $t$ be a destination point inside an $n$-vertex simple polygon $P$. Euclidean shortest paths and minimum-link paths between $s$ and $t$ inside $P$ have been well studied. Both these kinds of paths are simple and piecewise-convex. However, computing optimal paths in the context of diffuse or specular reflections does not seem to be an easy task. A path from a light source $s$ to $t$ inside $P$ is called a diffuse reflection path if the turning points of the path lie in the interiors of the boundary edges of $P$. A diffuse reflection path is said to be optimal if it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4320","kind":"arxiv","version":2},"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":"1304.4320","created_at":"2026-05-18T02:52:49.612601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4320v2","created_at":"2026-05-18T02:52:49.612601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4320","created_at":"2026-05-18T02:52:49.612601+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DZWVXOOAYOF","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DZWVXOOAYOF2OTC","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DZWVXOO","created_at":"2026-05-18T12:27:32.513160+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/3DZWVXOOAYOF2OTCEASLGNYIUD","json":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD.json","graph_json":"https://pith.science/api/pith-number/3DZWVXOOAYOF2OTCEASLGNYIUD/graph.json","events_json":"https://pith.science/api/pith-number/3DZWVXOOAYOF2OTCEASLGNYIUD/events.json","paper":"https://pith.science/paper/3DZWVXOO"},"agent_actions":{"view_html":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD","download_json":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD.json","view_paper":"https://pith.science/paper/3DZWVXOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4320&json=true","fetch_graph":"https://pith.science/api/pith-number/3DZWVXOOAYOF2OTCEASLGNYIUD/graph.json","fetch_events":"https://pith.science/api/pith-number/3DZWVXOOAYOF2OTCEASLGNYIUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/action/storage_attestation","attest_author":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/action/author_attestation","sign_citation":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/action/citation_signature","submit_replication":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/action/replication_record"}},"created_at":"2026-05-18T02:52:49.612601+00:00","updated_at":"2026-05-18T02:52:49.612601+00:00"}