{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BD4M6AWUQQSHSATYD65DEADHE7","short_pith_number":"pith:BD4M6AWU","schema_version":"1.0","canonical_sha256":"08f8cf02d484247902781fba32006727c190cb77c406f703b023ff5ee3de13f2","source":{"kind":"arxiv","id":"1208.0744","version":1},"attestation_state":"computed","paper":{"title":"Drawing outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noga Alon, Ohad Noy Feldheim","submitted_at":"2012-08-03T13:51:28Z","abstract_excerpt":"It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments."},"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":"1208.0744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-03T13:51:28Z","cross_cats_sorted":[],"title_canon_sha256":"b68d88277ea31e06b985067665c108ce4a8416ecdaa76b18647c1306abcf68e9","abstract_canon_sha256":"646603b7b31e80703c42b229d282c2d500be3f6e48faa1e7a9ae4924c8d4ac1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:38.368425Z","signature_b64":"aOtpmkZ308SIjt0xQcGXqJuTp4290MHW06pp+HjNGFiIk/A6tIR9J+c8AM30bKTlOsNycp9Zn2ihuyTpZBKYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08f8cf02d484247902781fba32006727c190cb77c406f703b023ff5ee3de13f2","last_reissued_at":"2026-05-18T01:09:38.367942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:38.367942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noga Alon, Ohad Noy Feldheim","submitted_at":"2012-08-03T13:51:28Z","abstract_excerpt":"It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0744","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":"1208.0744","created_at":"2026-05-18T01:09:38.368023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0744v1","created_at":"2026-05-18T01:09:38.368023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0744","created_at":"2026-05-18T01:09:38.368023+00:00"},{"alias_kind":"pith_short_12","alias_value":"BD4M6AWUQQSH","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BD4M6AWUQQSHSATY","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BD4M6AWU","created_at":"2026-05-18T12:26:58.693483+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/BD4M6AWUQQSHSATYD65DEADHE7","json":"https://pith.science/pith/BD4M6AWUQQSHSATYD65DEADHE7.json","graph_json":"https://pith.science/api/pith-number/BD4M6AWUQQSHSATYD65DEADHE7/graph.json","events_json":"https://pith.science/api/pith-number/BD4M6AWUQQSHSATYD65DEADHE7/events.json","paper":"https://pith.science/paper/BD4M6AWU"},"agent_actions":{"view_html":"https://pith.science/pith/BD4M6AWUQQSHSATYD65DEADHE7","download_json":"https://pith.science/pith/BD4M6AWUQQSHSATYD65DEADHE7.json","view_paper":"https://pith.science/paper/BD4M6AWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0744&json=true","fetch_graph":"https://pith.science/api/pith-number/BD4M6AWUQQSHSATYD65DEADHE7/graph.json","fetch_events":"https://pith.science/api/pith-number/BD4M6AWUQQSHSATYD65DEADHE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BD4M6AWUQQSHSATYD65DEADHE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BD4M6AWUQQSHSATYD65DEADHE7/action/storage_attestation","attest_author":"https://pith.science/pith/BD4M6AWUQQSHSATYD65DEADHE7/action/author_attestation","sign_citation":"https://pith.science/pith/BD4M6AWUQQSHSATYD65DEADHE7/action/citation_signature","submit_replication":"https://pith.science/pith/BD4M6AWUQQSHSATYD65DEADHE7/action/replication_record"}},"created_at":"2026-05-18T01:09:38.368023+00:00","updated_at":"2026-05-18T01:09:38.368023+00:00"}