{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JQOVCTMPW3J3JQUUZDSTWN7R66","short_pith_number":"pith:JQOVCTMP","schema_version":"1.0","canonical_sha256":"4c1d514d8fb6d3b4c294c8e53b37f1f7835f61ea77168adc8d9e38316eefa77a","source":{"kind":"arxiv","id":"1812.02412","version":3},"attestation_state":"computed","paper":{"title":"Euler Transformation of Polyhedral Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bala Krishnamoorthy, Prashant Gupta","submitted_at":"2018-12-06T09:21:44Z","abstract_excerpt":"We propose an Euler transformation that transforms a given $d$-dimensional cell complex $K$ for $d=2,3$ into a new $d$-complex $\\hat{K}$ in which every vertex is part of a uniform even number of edges. Hence every vertex in the graph $\\hat{G}$ that is the $1$-skeleton of $\\hat{K}$ has an even degree, which makes $\\hat{G}$ Eulerian, i.e., it is guaranteed to contain an Eulerian tour. Meshes whose edges admit Eulerian tours are crucial in coverage problems arising in several applications including 3D printing and robotics.\n  For $2$-complexes in $\\mathbb{R}^2$ ($d=2$) under mild assumptions (tha"},"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":"1812.02412","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-06T09:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"875fe82c4989d7e1fd3883426f576a391b1953cbee494525cc21fb3807abba82","abstract_canon_sha256":"ec12b54233c3cca2c3ff86f6b1850159b02e45788e3648e4e9f35a94c38ec423"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:59.932214Z","signature_b64":"EsFxpaYDfTGx3lpiwLkQmoxEw8h2m8np3W+AGSTPTnU/+nlsbXXvUANSljH6SxPBsq5BuRe+GOUWRLUvkovgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c1d514d8fb6d3b4c294c8e53b37f1f7835f61ea77168adc8d9e38316eefa77a","last_reissued_at":"2026-07-05T02:34:59.931886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:59.931886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Euler Transformation of Polyhedral Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bala Krishnamoorthy, Prashant Gupta","submitted_at":"2018-12-06T09:21:44Z","abstract_excerpt":"We propose an Euler transformation that transforms a given $d$-dimensional cell complex $K$ for $d=2,3$ into a new $d$-complex $\\hat{K}$ in which every vertex is part of a uniform even number of edges. Hence every vertex in the graph $\\hat{G}$ that is the $1$-skeleton of $\\hat{K}$ has an even degree, which makes $\\hat{G}$ Eulerian, i.e., it is guaranteed to contain an Eulerian tour. Meshes whose edges admit Eulerian tours are crucial in coverage problems arising in several applications including 3D printing and robotics.\n  For $2$-complexes in $\\mathbb{R}^2$ ($d=2$) under mild assumptions (tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02412","kind":"arxiv","version":3},"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/1812.02412/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":"1812.02412","created_at":"2026-07-05T02:34:59.931934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02412v3","created_at":"2026-07-05T02:34:59.931934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02412","created_at":"2026-07-05T02:34:59.931934+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQOVCTMPW3J3","created_at":"2026-07-05T02:34:59.931934+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQOVCTMPW3J3JQUU","created_at":"2026-07-05T02:34:59.931934+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQOVCTMP","created_at":"2026-07-05T02:34:59.931934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07452","citing_title":"Continuous Toolpath Planning in Additive Manufacturing","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66","json":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66.json","graph_json":"https://pith.science/api/pith-number/JQOVCTMPW3J3JQUUZDSTWN7R66/graph.json","events_json":"https://pith.science/api/pith-number/JQOVCTMPW3J3JQUUZDSTWN7R66/events.json","paper":"https://pith.science/paper/JQOVCTMP"},"agent_actions":{"view_html":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66","download_json":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66.json","view_paper":"https://pith.science/paper/JQOVCTMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02412&json=true","fetch_graph":"https://pith.science/api/pith-number/JQOVCTMPW3J3JQUUZDSTWN7R66/graph.json","fetch_events":"https://pith.science/api/pith-number/JQOVCTMPW3J3JQUUZDSTWN7R66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66/action/storage_attestation","attest_author":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66/action/author_attestation","sign_citation":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66/action/citation_signature","submit_replication":"https://pith.science/pith/JQOVCTMPW3J3JQUUZDSTWN7R66/action/replication_record"}},"created_at":"2026-07-05T02:34:59.931934+00:00","updated_at":"2026-07-05T02:34:59.931934+00:00"}