{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MTIKASXIAXCRVV5M6SWBAB24UK","short_pith_number":"pith:MTIKASXI","schema_version":"1.0","canonical_sha256":"64d0a04ae805c51ad7acf4ac10075ca29801fc02cca570fb3dd38566bcb8bc5d","source":{"kind":"arxiv","id":"1809.00628","version":1},"attestation_state":"computed","paper":{"title":"The Weighted Barycenter Drawing Recognition Problem","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nikola S. Nikolov, Patrick Healy, Peter Eades","submitted_at":"2018-09-03T15:30:09Z","abstract_excerpt":"We consider the question of whether a given graph drawing $\\Gamma$ of a triconnected planar graph $G$ is a weighted barycenter drawing. We answer the question with an elegant arithmetic characterisation using the faces of $\\Gamma$. This leads to positive answers when the graph is a Halin graph, and to a polynomial time recognition algorithm when the graph is cubic."},"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":"1809.00628","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-09-03T15:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"fff312d73ba6bb0e28fc6ec3684e7afb2b383e8e38bc10a2b4974670fabdba94","abstract_canon_sha256":"fc014f4d67b17b7be78bfa5f1d458ad5a3e7448630bc38bfeed4622797d7cc27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:32.985804Z","signature_b64":"rvmUksU1vAgfGR/ZLfjVdngqzCx07nXyea8RRnzIeFyTJ+zo7hqlAITSTT6bzj0wCA02Em/Eav/cXj5pt8oZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64d0a04ae805c51ad7acf4ac10075ca29801fc02cca570fb3dd38566bcb8bc5d","last_reissued_at":"2026-05-18T00:06:32.985078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:32.985078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Weighted Barycenter Drawing Recognition Problem","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nikola S. Nikolov, Patrick Healy, Peter Eades","submitted_at":"2018-09-03T15:30:09Z","abstract_excerpt":"We consider the question of whether a given graph drawing $\\Gamma$ of a triconnected planar graph $G$ is a weighted barycenter drawing. We answer the question with an elegant arithmetic characterisation using the faces of $\\Gamma$. This leads to positive answers when the graph is a Halin graph, and to a polynomial time recognition algorithm when the graph is cubic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00628","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":"1809.00628","created_at":"2026-05-18T00:06:32.985196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00628v1","created_at":"2026-05-18T00:06:32.985196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00628","created_at":"2026-05-18T00:06:32.985196+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTIKASXIAXCR","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTIKASXIAXCRVV5M","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTIKASXI","created_at":"2026-05-18T12:32:40.477152+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/MTIKASXIAXCRVV5M6SWBAB24UK","json":"https://pith.science/pith/MTIKASXIAXCRVV5M6SWBAB24UK.json","graph_json":"https://pith.science/api/pith-number/MTIKASXIAXCRVV5M6SWBAB24UK/graph.json","events_json":"https://pith.science/api/pith-number/MTIKASXIAXCRVV5M6SWBAB24UK/events.json","paper":"https://pith.science/paper/MTIKASXI"},"agent_actions":{"view_html":"https://pith.science/pith/MTIKASXIAXCRVV5M6SWBAB24UK","download_json":"https://pith.science/pith/MTIKASXIAXCRVV5M6SWBAB24UK.json","view_paper":"https://pith.science/paper/MTIKASXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00628&json=true","fetch_graph":"https://pith.science/api/pith-number/MTIKASXIAXCRVV5M6SWBAB24UK/graph.json","fetch_events":"https://pith.science/api/pith-number/MTIKASXIAXCRVV5M6SWBAB24UK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTIKASXIAXCRVV5M6SWBAB24UK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTIKASXIAXCRVV5M6SWBAB24UK/action/storage_attestation","attest_author":"https://pith.science/pith/MTIKASXIAXCRVV5M6SWBAB24UK/action/author_attestation","sign_citation":"https://pith.science/pith/MTIKASXIAXCRVV5M6SWBAB24UK/action/citation_signature","submit_replication":"https://pith.science/pith/MTIKASXIAXCRVV5M6SWBAB24UK/action/replication_record"}},"created_at":"2026-05-18T00:06:32.985196+00:00","updated_at":"2026-05-18T00:06:32.985196+00:00"}