{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PHFS6S2VNLWB43T6OTRTRXMCFK","short_pith_number":"pith:PHFS6S2V","schema_version":"1.0","canonical_sha256":"79cb2f4b556aec1e6e7e74e338dd822aae02dcef8a471354de810f1aa5e17f4b","source":{"kind":"arxiv","id":"1908.07452","version":2},"attestation_state":"computed","paper":{"title":"Continuous Toolpath Planning in Additive Manufacturing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.RO"],"primary_cat":"cs.CG","authors_text":"Bala Krishnamoorthy, Gregory Dreifus, Prashant Gupta","submitted_at":"2019-08-19T01:40:35Z","abstract_excerpt":"We develop a framework that creates a new polygonal mesh representation of the sparse infill domain of a layer-by-layer 3D printing job. We guarantee the existence of a single, continuous tool path covering each connected piece of the domain in every layer. We present a tool path algorithm that traverses each such continuous tool path with no crossovers. The key construction at the heart of our framework is an Euler transformation which converts a 2-dimensional cell complex K into a new 2-complex K^ such that every vertex in the 1-skeleton G^ of K^ has even degree. Hence G^ is Eulerian, and a "},"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":"1908.07452","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-19T01:40:35Z","cross_cats_sorted":["cs.GR","cs.RO"],"title_canon_sha256":"736240f09607b5005df0be67057a05841cb0b5eeb2fa8af918b66720a4ffab5c","abstract_canon_sha256":"ab81a97e2e90e670d935cacae61b39ec0b9c38046ce0d5a0de7c255481146ab8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:37.661903Z","signature_b64":"Sd5Cg+RUt5uyJ/ksChS87Mk1RHVfCd5mk9MrwOvyrDqxV/5qkoQYvYwiAUSjURFiGhZThqnuB0FpAXh7VxagAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79cb2f4b556aec1e6e7e74e338dd822aae02dcef8a471354de810f1aa5e17f4b","last_reissued_at":"2026-07-05T02:34:37.661426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:37.661426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous Toolpath Planning in Additive Manufacturing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.RO"],"primary_cat":"cs.CG","authors_text":"Bala Krishnamoorthy, Gregory Dreifus, Prashant Gupta","submitted_at":"2019-08-19T01:40:35Z","abstract_excerpt":"We develop a framework that creates a new polygonal mesh representation of the sparse infill domain of a layer-by-layer 3D printing job. We guarantee the existence of a single, continuous tool path covering each connected piece of the domain in every layer. We present a tool path algorithm that traverses each such continuous tool path with no crossovers. The key construction at the heart of our framework is an Euler transformation which converts a 2-dimensional cell complex K into a new 2-complex K^ such that every vertex in the 1-skeleton G^ of K^ has even degree. Hence G^ is Eulerian, and a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07452","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07452/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.07452","created_at":"2026-07-05T02:34:37.661491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07452v2","created_at":"2026-07-05T02:34:37.661491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07452","created_at":"2026-07-05T02:34:37.661491+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHFS6S2VNLWB","created_at":"2026-07-05T02:34:37.661491+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHFS6S2VNLWB43T6","created_at":"2026-07-05T02:34:37.661491+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHFS6S2V","created_at":"2026-07-05T02:34:37.661491+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/PHFS6S2VNLWB43T6OTRTRXMCFK","json":"https://pith.science/pith/PHFS6S2VNLWB43T6OTRTRXMCFK.json","graph_json":"https://pith.science/api/pith-number/PHFS6S2VNLWB43T6OTRTRXMCFK/graph.json","events_json":"https://pith.science/api/pith-number/PHFS6S2VNLWB43T6OTRTRXMCFK/events.json","paper":"https://pith.science/paper/PHFS6S2V"},"agent_actions":{"view_html":"https://pith.science/pith/PHFS6S2VNLWB43T6OTRTRXMCFK","download_json":"https://pith.science/pith/PHFS6S2VNLWB43T6OTRTRXMCFK.json","view_paper":"https://pith.science/paper/PHFS6S2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07452&json=true","fetch_graph":"https://pith.science/api/pith-number/PHFS6S2VNLWB43T6OTRTRXMCFK/graph.json","fetch_events":"https://pith.science/api/pith-number/PHFS6S2VNLWB43T6OTRTRXMCFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHFS6S2VNLWB43T6OTRTRXMCFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHFS6S2VNLWB43T6OTRTRXMCFK/action/storage_attestation","attest_author":"https://pith.science/pith/PHFS6S2VNLWB43T6OTRTRXMCFK/action/author_attestation","sign_citation":"https://pith.science/pith/PHFS6S2VNLWB43T6OTRTRXMCFK/action/citation_signature","submit_replication":"https://pith.science/pith/PHFS6S2VNLWB43T6OTRTRXMCFK/action/replication_record"}},"created_at":"2026-07-05T02:34:37.661491+00:00","updated_at":"2026-07-05T02:34:37.661491+00:00"}