{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DSYH4PXKTO54IQQHTJJO5LHDWK","short_pith_number":"pith:DSYH4PXK","schema_version":"1.0","canonical_sha256":"1cb07e3eea9bbbc442079a52eeace3b2b9986829d2be006e39fd1305064aa4c5","source":{"kind":"arxiv","id":"1506.03728","version":1},"attestation_state":"computed","paper":{"title":"Upper and Lower Bounds on Long Dual-Paths in Line Arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Linda Kleist, Tillmann Miltzow, Udo Hoffmann","submitted_at":"2015-06-11T16:09:05Z","abstract_excerpt":"Given a line arrangement $\\cal A$ with $n$ lines, we show that there exists a path of length $n^2/3 - O(n)$ in the dual graph of $\\cal A$ formed by its faces. This bound is tight up to lower order terms. For the bicolored version, we describe an example of a line arrangement with $3k$ blue and $2k$ red lines with no alternating path longer than $14k$. Further, we show that any line arrangement with $n$ lines has a coloring such that it has an alternating path of length $\\Omega (n^2/ \\log n)$. Our results also hold for pseudoline arrangements."},"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":"1506.03728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-11T16:09:05Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"784090f5a9e1cadb4ba6bb330103a7877ae0182a2090b09a5067a1efffe31eb1","abstract_canon_sha256":"c5b25a938a8fc9dead68805708e9448abfcefe99bdbfa6c975f3928f17dc1651"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:03.421963Z","signature_b64":"KDk99BAjFpvxXONQDABSfN8TBSDHDStVuX5O0eDrrLNCWBQfGwYQqoXNdHXjm0cmf2nTY1Tu8YaOF5HmsdaHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cb07e3eea9bbbc442079a52eeace3b2b9986829d2be006e39fd1305064aa4c5","last_reissued_at":"2026-05-18T01:53:03.421268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:03.421268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper and Lower Bounds on Long Dual-Paths in Line Arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Linda Kleist, Tillmann Miltzow, Udo Hoffmann","submitted_at":"2015-06-11T16:09:05Z","abstract_excerpt":"Given a line arrangement $\\cal A$ with $n$ lines, we show that there exists a path of length $n^2/3 - O(n)$ in the dual graph of $\\cal A$ formed by its faces. This bound is tight up to lower order terms. For the bicolored version, we describe an example of a line arrangement with $3k$ blue and $2k$ red lines with no alternating path longer than $14k$. Further, we show that any line arrangement with $n$ lines has a coloring such that it has an alternating path of length $\\Omega (n^2/ \\log n)$. Our results also hold for pseudoline arrangements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03728","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":"1506.03728","created_at":"2026-05-18T01:53:03.421390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03728v1","created_at":"2026-05-18T01:53:03.421390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03728","created_at":"2026-05-18T01:53:03.421390+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSYH4PXKTO54","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSYH4PXKTO54IQQH","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSYH4PXK","created_at":"2026-05-18T12:29:17.054201+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/DSYH4PXKTO54IQQHTJJO5LHDWK","json":"https://pith.science/pith/DSYH4PXKTO54IQQHTJJO5LHDWK.json","graph_json":"https://pith.science/api/pith-number/DSYH4PXKTO54IQQHTJJO5LHDWK/graph.json","events_json":"https://pith.science/api/pith-number/DSYH4PXKTO54IQQHTJJO5LHDWK/events.json","paper":"https://pith.science/paper/DSYH4PXK"},"agent_actions":{"view_html":"https://pith.science/pith/DSYH4PXKTO54IQQHTJJO5LHDWK","download_json":"https://pith.science/pith/DSYH4PXKTO54IQQHTJJO5LHDWK.json","view_paper":"https://pith.science/paper/DSYH4PXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03728&json=true","fetch_graph":"https://pith.science/api/pith-number/DSYH4PXKTO54IQQHTJJO5LHDWK/graph.json","fetch_events":"https://pith.science/api/pith-number/DSYH4PXKTO54IQQHTJJO5LHDWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSYH4PXKTO54IQQHTJJO5LHDWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSYH4PXKTO54IQQHTJJO5LHDWK/action/storage_attestation","attest_author":"https://pith.science/pith/DSYH4PXKTO54IQQHTJJO5LHDWK/action/author_attestation","sign_citation":"https://pith.science/pith/DSYH4PXKTO54IQQHTJJO5LHDWK/action/citation_signature","submit_replication":"https://pith.science/pith/DSYH4PXKTO54IQQHTJJO5LHDWK/action/replication_record"}},"created_at":"2026-05-18T01:53:03.421390+00:00","updated_at":"2026-05-18T01:53:03.421390+00:00"}