{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3DZWVXOOAYOF2OTCEASLGNYIUD","short_pith_number":"pith:3DZWVXOO","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"},"canonical_sha256":"d8f36addce061c5d3a622024b33708a0d1673d7b05c17d826dc8565b5297c0c8","source":{"kind":"arxiv","id":"1304.4320","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4320","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4320v2","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4320","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"3DZWVXOOAYOF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3DZWVXOOAYOF2OTC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3DZWVXOO","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3DZWVXOOAYOF2OTCEASLGNYIUD","target":"record","payload":{"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"},"canonical_sha256":"d8f36addce061c5d3a622024b33708a0d1673d7b05c17d826dc8565b5297c0c8","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"},"source_kind":"arxiv","source_id":"1304.4320","source_version":2,"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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caesda5/EWGSvmCgZcfv/nrELzZlUzbJaZZ5Yu5choUd+kMSGAxrEB/cs+5NRsvN7t7yTeGh11fGfZoTY3V+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:09:04.553123Z"},"content_sha256":"e7ea5a4b54b701338f4aafde86111754af54d77a331c5978beae97e23d525f9d","schema_version":"1.0","event_id":"sha256:e7ea5a4b54b701338f4aafde86111754af54d77a331c5978beae97e23d525f9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3DZWVXOOAYOF2OTCEASLGNYIUD","target":"graph","payload":{"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"},"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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcmxpJlYmnBr/LLkVD9qSFNag/skDPxLJtS4YXvg8e7v+k8Ogo7yyg3swa7S4F4vWvt67DrS03bspXIB52/nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:09:04.553492Z"},"content_sha256":"66ceb77e010ff96f119a5b999ed605f026fcb342c3f62dec1c92fbad0db32b8d","schema_version":"1.0","event_id":"sha256:66ceb77e010ff96f119a5b999ed605f026fcb342c3f62dec1c92fbad0db32b8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/bundle.json","state_url":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/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-05-28T13:09:04Z","links":{"resolver":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD","bundle":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/bundle.json","state":"https://pith.science/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DZWVXOOAYOF2OTCEASLGNYIUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3DZWVXOOAYOF2OTCEASLGNYIUD","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":"672394d12d67ad2b559ad7349c619acfcd56f43a39c80df5fa05951429bf8383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-16T03:31:05Z","title_canon_sha256":"c34465b2ef09a8c92587bd3648416817def8d6a5ac78dd97107d89f0bdacfa26"},"schema_version":"1.0","source":{"id":"1304.4320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4320","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4320v2","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4320","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"3DZWVXOOAYOF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3DZWVXOOAYOF2OTC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3DZWVXOO","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:66ceb77e010ff96f119a5b999ed605f026fcb342c3f62dec1c92fbad0db32b8d","target":"graph","created_at":"2026-05-18T02:52:49Z","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":"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","authors_text":"Arijit Bishnu, Partha Pratim Goswami, Subir Kumar Ghosh, Sudebkumar Prasant Pal, Swami Sarvattomananda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-16T03:31:05Z","title":"An Algorithm for Computing Constrained Reflection Paths in Simple Polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4320","kind":"arxiv","version":2},"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:e7ea5a4b54b701338f4aafde86111754af54d77a331c5978beae97e23d525f9d","target":"record","created_at":"2026-05-18T02:52:49Z","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":"672394d12d67ad2b559ad7349c619acfcd56f43a39c80df5fa05951429bf8383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-16T03:31:05Z","title_canon_sha256":"c34465b2ef09a8c92587bd3648416817def8d6a5ac78dd97107d89f0bdacfa26"},"schema_version":"1.0","source":{"id":"1304.4320","kind":"arxiv","version":2}},"canonical_sha256":"d8f36addce061c5d3a622024b33708a0d1673d7b05c17d826dc8565b5297c0c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8f36addce061c5d3a622024b33708a0d1673d7b05c17d826dc8565b5297c0c8","first_computed_at":"2026-05-18T02:52:49.612537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:49.612537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fRsRqkZsppNFi3ZxCcAggV57EkkkZ2005HGJ+pqWG5X9Bkz0p54rC+TnkX/23lJ+9kYcm6CNrOH45tz0pX3XBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:49.612934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7ea5a4b54b701338f4aafde86111754af54d77a331c5978beae97e23d525f9d","sha256:66ceb77e010ff96f119a5b999ed605f026fcb342c3f62dec1c92fbad0db32b8d"],"state_sha256":"76d76794b20630731f7bcb4bd0a72ea92d5ac18e5f39b84748631b5313120e04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QvjU7WhTtmizwClcNO7wohANE/fsoz55jyt+z78OOnH9QCfJJinGHH01qIrgbw/X00ThO19H7Ti1XHxnzpVFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:09:04.555656Z","bundle_sha256":"3c601e220275386d8d472b69da2237442fbe455d673f22afec5a9c2551a52349"}}