{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YET3L2R5IGJW6KAL2AFRD6N445","short_pith_number":"pith:YET3L2R5","schema_version":"1.0","canonical_sha256":"c127b5ea3d41936f280bd00b11f9bce76dbe36c75f2a21c485a11fac9da82390","source":{"kind":"arxiv","id":"1607.05704","version":1},"attestation_state":"computed","paper":{"title":"FPGA based hybrid architecture for parallelizing RRT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gurshaant Malik, K Madhava Krishna, Krishna Gupta, Raunak Dharani","submitted_at":"2016-07-19T19:25:38Z","abstract_excerpt":"Field Programmable Gate Arrays(FPGA) exceed the computing power of software based implementations by breaking the paradigm of sequential execution and accomplishing more per clock cycle by enabling hardware level parallelization at an architectural level. Introducing parallel architectures for a computationally intensive algorithm like Rapidly Exploring Random Trees(RRT) will result in an exploration that is fast, dense and uniform. Through a cost function delineated in later sections, FPGA based combinatorial architecture delivers superlative speed-up but consumes very high power while hierar"},"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":"1607.05704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-19T19:25:38Z","cross_cats_sorted":[],"title_canon_sha256":"bb91f8682ba85651c726f3958b2e22d569de1b895d138c0a23a222bfcc333eb4","abstract_canon_sha256":"f25367932b1e276223d455b0eb71f278ecab9225f906c7b42b0943badc36644a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:46.209124Z","signature_b64":"ne5WX4i5Qq97lghpNFB6CvNkIHF7e2QdC/E5niLH+gnZbywpRLqBC6CIwPiwaeEEYandKn9axwigsGA73kgwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c127b5ea3d41936f280bd00b11f9bce76dbe36c75f2a21c485a11fac9da82390","last_reissued_at":"2026-05-18T01:10:46.208721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:46.208721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPGA based hybrid architecture for parallelizing RRT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gurshaant Malik, K Madhava Krishna, Krishna Gupta, Raunak Dharani","submitted_at":"2016-07-19T19:25:38Z","abstract_excerpt":"Field Programmable Gate Arrays(FPGA) exceed the computing power of software based implementations by breaking the paradigm of sequential execution and accomplishing more per clock cycle by enabling hardware level parallelization at an architectural level. Introducing parallel architectures for a computationally intensive algorithm like Rapidly Exploring Random Trees(RRT) will result in an exploration that is fast, dense and uniform. Through a cost function delineated in later sections, FPGA based combinatorial architecture delivers superlative speed-up but consumes very high power while hierar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05704","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":"1607.05704","created_at":"2026-05-18T01:10:46.208791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05704v1","created_at":"2026-05-18T01:10:46.208791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05704","created_at":"2026-05-18T01:10:46.208791+00:00"},{"alias_kind":"pith_short_12","alias_value":"YET3L2R5IGJW","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YET3L2R5IGJW6KAL","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YET3L2R5","created_at":"2026-05-18T12:30:53.716459+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/YET3L2R5IGJW6KAL2AFRD6N445","json":"https://pith.science/pith/YET3L2R5IGJW6KAL2AFRD6N445.json","graph_json":"https://pith.science/api/pith-number/YET3L2R5IGJW6KAL2AFRD6N445/graph.json","events_json":"https://pith.science/api/pith-number/YET3L2R5IGJW6KAL2AFRD6N445/events.json","paper":"https://pith.science/paper/YET3L2R5"},"agent_actions":{"view_html":"https://pith.science/pith/YET3L2R5IGJW6KAL2AFRD6N445","download_json":"https://pith.science/pith/YET3L2R5IGJW6KAL2AFRD6N445.json","view_paper":"https://pith.science/paper/YET3L2R5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05704&json=true","fetch_graph":"https://pith.science/api/pith-number/YET3L2R5IGJW6KAL2AFRD6N445/graph.json","fetch_events":"https://pith.science/api/pith-number/YET3L2R5IGJW6KAL2AFRD6N445/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YET3L2R5IGJW6KAL2AFRD6N445/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YET3L2R5IGJW6KAL2AFRD6N445/action/storage_attestation","attest_author":"https://pith.science/pith/YET3L2R5IGJW6KAL2AFRD6N445/action/author_attestation","sign_citation":"https://pith.science/pith/YET3L2R5IGJW6KAL2AFRD6N445/action/citation_signature","submit_replication":"https://pith.science/pith/YET3L2R5IGJW6KAL2AFRD6N445/action/replication_record"}},"created_at":"2026-05-18T01:10:46.208791+00:00","updated_at":"2026-05-18T01:10:46.208791+00:00"}