{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TEKGBWC6YYZUITRG3YNM6NBDUP","short_pith_number":"pith:TEKGBWC6","canonical_record":{"source":{"id":"2007.09626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-19T08:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"518fd976a70199ee0759872116a477a7afa10d51c6975bacb63b41ebfe10f481","abstract_canon_sha256":"c2cce402cc43695da786048e49d91253f0b775a0f2c69e3d19e7599c60a9ebf9"},"schema_version":"1.0"},"canonical_sha256":"991460d85ec633444e26de1acf3423a3ff4b437dbc0f315bcbd87f64159e3623","source":{"kind":"arxiv","id":"2007.09626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.09626","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"2007.09626v1","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.09626","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"TEKGBWC6YYZU","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"pith_short_16","alias_value":"TEKGBWC6YYZUITRG","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"pith_short_8","alias_value":"TEKGBWC6","created_at":"2026-07-05T01:20:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TEKGBWC6YYZUITRG3YNM6NBDUP","target":"record","payload":{"canonical_record":{"source":{"id":"2007.09626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-19T08:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"518fd976a70199ee0759872116a477a7afa10d51c6975bacb63b41ebfe10f481","abstract_canon_sha256":"c2cce402cc43695da786048e49d91253f0b775a0f2c69e3d19e7599c60a9ebf9"},"schema_version":"1.0"},"canonical_sha256":"991460d85ec633444e26de1acf3423a3ff4b437dbc0f315bcbd87f64159e3623","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:27.234092Z","signature_b64":"aB9gjuxQMkjsIcn5miqFpyIqljvIozjsc2rqZMClHuDyRgCGrJATwquOTZrAaYDtCp4O3i4mztjo2SjeRFAIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"991460d85ec633444e26de1acf3423a3ff4b437dbc0f315bcbd87f64159e3623","last_reissued_at":"2026-07-05T01:20:27.233681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:27.233681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.09626","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-07-05T01:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxuIqLMUfYWGs0sF/tPqRIUSUhLKYjxXRl3SCQysPlRxul3x5ISpoRkyOizLZx7oQP18PbZQwfkY/Q87bIfHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T15:25:30.774078Z"},"content_sha256":"b6351b275063c5e1898e5fcb2db6ab8f309b3f3095b98494d2fa2f3fa11463fe","schema_version":"1.0","event_id":"sha256:b6351b275063c5e1898e5fcb2db6ab8f309b3f3095b98494d2fa2f3fa11463fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TEKGBWC6YYZUITRG3YNM6NBDUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal tool path planning for 3D printing with spatio-temporal and thermal constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Pavana Prabhakar, Pavithra Prabhakar, Zahra Rahimi Afzal","submitted_at":"2020-07-19T08:58:56Z","abstract_excerpt":"In this paper, we address the problem of synthesizing optimal path plans in a 2D subject to spatio-temporal and thermal constraints. Our solution consists of reducing the path planning problem to a Mixed Integer Linear Programming (MILP) problem. The challenge is in encoding the implication constraints in the path planning problem using only conjunctions that are permitted by the MILP formulation. Our experimental analysis using an implementation of the encoding in a Python toolbox demonstrates the feasibility of our approach in generating the optimal plans."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.09626","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.09626/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDTs4KlJ9Ae19LQnWGhThmMDlIBjOs0M9dZaDRfUNyXwHzXmAHPorlH7XMBaNyK6uQ+DZoBpBppBzINux8XeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T15:25:30.774451Z"},"content_sha256":"38710178de648760648675af0b162d9b8834e564e8accdb9638f5831952dfc1e","schema_version":"1.0","event_id":"sha256:38710178de648760648675af0b162d9b8834e564e8accdb9638f5831952dfc1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEKGBWC6YYZUITRG3YNM6NBDUP/bundle.json","state_url":"https://pith.science/pith/TEKGBWC6YYZUITRG3YNM6NBDUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEKGBWC6YYZUITRG3YNM6NBDUP/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-08-23T15:25:30Z","links":{"resolver":"https://pith.science/pith/TEKGBWC6YYZUITRG3YNM6NBDUP","bundle":"https://pith.science/pith/TEKGBWC6YYZUITRG3YNM6NBDUP/bundle.json","state":"https://pith.science/pith/TEKGBWC6YYZUITRG3YNM6NBDUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEKGBWC6YYZUITRG3YNM6NBDUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TEKGBWC6YYZUITRG3YNM6NBDUP","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":"c2cce402cc43695da786048e49d91253f0b775a0f2c69e3d19e7599c60a9ebf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-19T08:58:56Z","title_canon_sha256":"518fd976a70199ee0759872116a477a7afa10d51c6975bacb63b41ebfe10f481"},"schema_version":"1.0","source":{"id":"2007.09626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.09626","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"2007.09626v1","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.09626","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"TEKGBWC6YYZU","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"pith_short_16","alias_value":"TEKGBWC6YYZUITRG","created_at":"2026-07-05T01:20:27Z"},{"alias_kind":"pith_short_8","alias_value":"TEKGBWC6","created_at":"2026-07-05T01:20:27Z"}],"graph_snapshots":[{"event_id":"sha256:38710178de648760648675af0b162d9b8834e564e8accdb9638f5831952dfc1e","target":"graph","created_at":"2026-07-05T01:20:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.09626/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we address the problem of synthesizing optimal path plans in a 2D subject to spatio-temporal and thermal constraints. Our solution consists of reducing the path planning problem to a Mixed Integer Linear Programming (MILP) problem. The challenge is in encoding the implication constraints in the path planning problem using only conjunctions that are permitted by the MILP formulation. Our experimental analysis using an implementation of the encoding in a Python toolbox demonstrates the feasibility of our approach in generating the optimal plans.","authors_text":"Pavana Prabhakar, Pavithra Prabhakar, Zahra Rahimi Afzal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-19T08:58:56Z","title":"Optimal tool path planning for 3D printing with spatio-temporal and thermal constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.09626","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:b6351b275063c5e1898e5fcb2db6ab8f309b3f3095b98494d2fa2f3fa11463fe","target":"record","created_at":"2026-07-05T01:20:27Z","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":"c2cce402cc43695da786048e49d91253f0b775a0f2c69e3d19e7599c60a9ebf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-19T08:58:56Z","title_canon_sha256":"518fd976a70199ee0759872116a477a7afa10d51c6975bacb63b41ebfe10f481"},"schema_version":"1.0","source":{"id":"2007.09626","kind":"arxiv","version":1}},"canonical_sha256":"991460d85ec633444e26de1acf3423a3ff4b437dbc0f315bcbd87f64159e3623","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"991460d85ec633444e26de1acf3423a3ff4b437dbc0f315bcbd87f64159e3623","first_computed_at":"2026-07-05T01:20:27.233681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:20:27.233681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aB9gjuxQMkjsIcn5miqFpyIqljvIozjsc2rqZMClHuDyRgCGrJATwquOTZrAaYDtCp4O3i4mztjo2SjeRFAIDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:20:27.234092Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.09626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6351b275063c5e1898e5fcb2db6ab8f309b3f3095b98494d2fa2f3fa11463fe","sha256:38710178de648760648675af0b162d9b8834e564e8accdb9638f5831952dfc1e"],"state_sha256":"188136661dff03992955a3d24b3dfdcf8c87f6dade67149d27fc6c4e51749df8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DtxZAF/v1TmqlIsp8/F8VLEwJG7EwpERqVF3iKjVQKa3HT1dDzM6ZcL/bO4LPNbHRUYDxI8OjD24cAolEpfkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T15:25:30.777124Z","bundle_sha256":"6e670de40074dce4e52319addcf255d7eab9503200d6cd166086f572a3d3bac1"}}