{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GDKIA6DB5I6KQ6EJ6V7ZFXPPOO","short_pith_number":"pith:GDKIA6DB","schema_version":"1.0","canonical_sha256":"30d4807861ea3ca87889f57f92ddef73b1941c81eea871307440d754a6a285ff","source":{"kind":"arxiv","id":"1703.01544","version":1},"attestation_state":"computed","paper":{"title":"L-Graphs and Monotone L-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abu Reyan Ahmed, Alon Efrat, Eric Welch, Felice De Luca, Jixian Li, Md Iqbal Hossain, Sabin Devkota, Sammi Abida Salma, Stephen Kobourov","submitted_at":"2017-03-05T01:41:08Z","abstract_excerpt":"In an $\\mathsf{L}$-embedding of a graph, each vertex is represented by an $\\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each $\\mathsf{L}$-segment in an $\\mathsf{L}$-embedding lies on a straight line, we call it a monotone $\\mathsf{L}$-embedding. In this paper we give a full characterization of monotone $\\mathsf{L}$-embeddings by introducing a new class of graphs which we call \"non-jumping\" graphs. We show that a graph admits a monotone $\\mathsf{L}$-embedding if and only if the graph is a non-jum"},"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":"1703.01544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-05T01:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"f890f72bc1d856410122223a3244c568f3ef818608ed7a5855c02430bdd527aa","abstract_canon_sha256":"4a3c5d6f463b7a0f1fb2c41e60b632c7b0d6c47ed7004b4da76bcc497c11c213"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:30.354238Z","signature_b64":"6IoPpxbdGh1u40zGAE7XnNlJOKKkK6x25VPZVA7x4Fh2KaBEtc6P3UZdh6v8wnbakDPeN7rjptg7a4LJazrRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30d4807861ea3ca87889f57f92ddef73b1941c81eea871307440d754a6a285ff","last_reissued_at":"2026-05-18T00:49:30.353634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:30.353634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L-Graphs and Monotone L-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abu Reyan Ahmed, Alon Efrat, Eric Welch, Felice De Luca, Jixian Li, Md Iqbal Hossain, Sabin Devkota, Sammi Abida Salma, Stephen Kobourov","submitted_at":"2017-03-05T01:41:08Z","abstract_excerpt":"In an $\\mathsf{L}$-embedding of a graph, each vertex is represented by an $\\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each $\\mathsf{L}$-segment in an $\\mathsf{L}$-embedding lies on a straight line, we call it a monotone $\\mathsf{L}$-embedding. In this paper we give a full characterization of monotone $\\mathsf{L}$-embeddings by introducing a new class of graphs which we call \"non-jumping\" graphs. We show that a graph admits a monotone $\\mathsf{L}$-embedding if and only if the graph is a non-jum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01544","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":"1703.01544","created_at":"2026-05-18T00:49:30.353721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01544v1","created_at":"2026-05-18T00:49:30.353721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01544","created_at":"2026-05-18T00:49:30.353721+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDKIA6DB5I6K","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDKIA6DB5I6KQ6EJ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDKIA6DB","created_at":"2026-05-18T12:31:15.632608+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/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO","json":"https://pith.science/pith/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO.json","graph_json":"https://pith.science/api/pith-number/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/graph.json","events_json":"https://pith.science/api/pith-number/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/events.json","paper":"https://pith.science/paper/GDKIA6DB"},"agent_actions":{"view_html":"https://pith.science/pith/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO","download_json":"https://pith.science/pith/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO.json","view_paper":"https://pith.science/paper/GDKIA6DB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01544&json=true","fetch_graph":"https://pith.science/api/pith-number/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/graph.json","fetch_events":"https://pith.science/api/pith-number/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/action/storage_attestation","attest_author":"https://pith.science/pith/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/action/author_attestation","sign_citation":"https://pith.science/pith/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/action/citation_signature","submit_replication":"https://pith.science/pith/GDKIA6DB5I6KQ6EJ6V7ZFXPPOO/action/replication_record"}},"created_at":"2026-05-18T00:49:30.353721+00:00","updated_at":"2026-05-18T00:49:30.353721+00:00"}