{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SC7OWC3MX433OR2EZXRODMAANI","short_pith_number":"pith:SC7OWC3M","schema_version":"1.0","canonical_sha256":"90beeb0b6cbf37b74744cde2e1b0006a2894edfcda4a8b222e2e4bbe672635a5","source":{"kind":"arxiv","id":"2511.23226","version":2},"attestation_state":"computed","paper":{"title":"North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Satisfiability solvers classify all north-east lattice paths avoiding up to six collinear points and find a 327-step example for seven.","cross_cats":["cs.DM","cs.LO"],"primary_cat":"math.CO","authors_text":"Aaron Barnoff, Curtis Bright","submitted_at":"2025-11-28T14:34:26Z","abstract_excerpt":"We investigate the Gerver-Ramsey collinearity problem of determining the maximum number of points in a north-east lattice path without $k$ collinear points. Using a satisfiability solver, up to isomorphism we enumerate all north-east lattice paths avoiding $k$ collinear points for $k \\leq 6$. We also find a north-east lattice path avoiding $k = 7$ collinear points with 327 steps, improving on the previous best length of 260 steps found by Shallit."},"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":"2511.23226","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-28T14:34:26Z","cross_cats_sorted":["cs.DM","cs.LO"],"title_canon_sha256":"80483a16a9d4dff14d7fce707ada7d433e486e1c256d15ec5ab1f92a663c772d","abstract_canon_sha256":"4b45024312406ceb27607ba42d3457058853b5e83107d6b51d58902dd6201896"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:59.586412Z","signature_b64":"6/3t8jX0WGyBBEKnOTjKw2yg9pD/rJ9FVFOePdF8xfPdDqXbMj6piCocJEPMOxMucE4glg4xCS4cCbUA3EgrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90beeb0b6cbf37b74744cde2e1b0006a2894edfcda4a8b222e2e4bbe672635a5","last_reissued_at":"2026-05-20T00:02:59.585505Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:59.585505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Satisfiability solvers classify all north-east lattice paths avoiding up to six collinear points and find a 327-step example for seven.","cross_cats":["cs.DM","cs.LO"],"primary_cat":"math.CO","authors_text":"Aaron Barnoff, Curtis Bright","submitted_at":"2025-11-28T14:34:26Z","abstract_excerpt":"We investigate the Gerver-Ramsey collinearity problem of determining the maximum number of points in a north-east lattice path without $k$ collinear points. Using a satisfiability solver, up to isomorphism we enumerate all north-east lattice paths avoiding $k$ collinear points for $k \\leq 6$. We also find a north-east lattice path avoiding $k = 7$ collinear points with 327 steps, improving on the previous best length of 260 steps found by Shallit."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We also find a north-east lattice path avoiding k = 7 collinear points with 327 steps, improving on the previous best length of 260 steps found by Shallit.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The SAT encoding correctly captures the collinearity-avoidance condition and the solver's search is exhaustive up to isomorphism for k≤6 and finds a valid 327-step example for k=7.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SAT solvers enumerate all north-east lattice paths avoiding k collinear points for k≤6 and produce a 327-step path for k=7, improving the prior record of 260 steps.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Satisfiability solvers classify all north-east lattice paths avoiding up to six collinear points and find a 327-step example for seven.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"42600e5692e5a3000c7b1a7baa69ea8654e568e2d2cd4542109b7706a5b9de3a"},"source":{"id":"2511.23226","kind":"arxiv","version":2},"verdict":{"id":"91b87144-e3b3-4533-965d-d4f6075a3bc7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T03:53:49.565526Z","strongest_claim":"We also find a north-east lattice path avoiding k = 7 collinear points with 327 steps, improving on the previous best length of 260 steps found by Shallit.","one_line_summary":"SAT solvers enumerate all north-east lattice paths avoiding k collinear points for k≤6 and produce a 327-step path for k=7, improving the prior record of 260 steps.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The SAT encoding correctly captures the collinearity-avoidance condition and the solver's search is exhaustive up to isomorphism for k≤6 and finds a valid 327-step example for k=7.","pith_extraction_headline":"Satisfiability solvers classify all north-east lattice paths avoiding up to six collinear points and find a 327-step example for seven."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.23226/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":"2511.23226","created_at":"2026-05-20T00:02:59.585607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.23226v2","created_at":"2026-05-20T00:02:59.585607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.23226","created_at":"2026-05-20T00:02:59.585607+00:00"},{"alias_kind":"pith_short_12","alias_value":"SC7OWC3MX433","created_at":"2026-05-20T00:02:59.585607+00:00"},{"alias_kind":"pith_short_16","alias_value":"SC7OWC3MX433OR2E","created_at":"2026-05-20T00:02:59.585607+00:00"},{"alias_kind":"pith_short_8","alias_value":"SC7OWC3M","created_at":"2026-05-20T00:02:59.585607+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/SC7OWC3MX433OR2EZXRODMAANI","json":"https://pith.science/pith/SC7OWC3MX433OR2EZXRODMAANI.json","graph_json":"https://pith.science/api/pith-number/SC7OWC3MX433OR2EZXRODMAANI/graph.json","events_json":"https://pith.science/api/pith-number/SC7OWC3MX433OR2EZXRODMAANI/events.json","paper":"https://pith.science/paper/SC7OWC3M"},"agent_actions":{"view_html":"https://pith.science/pith/SC7OWC3MX433OR2EZXRODMAANI","download_json":"https://pith.science/pith/SC7OWC3MX433OR2EZXRODMAANI.json","view_paper":"https://pith.science/paper/SC7OWC3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.23226&json=true","fetch_graph":"https://pith.science/api/pith-number/SC7OWC3MX433OR2EZXRODMAANI/graph.json","fetch_events":"https://pith.science/api/pith-number/SC7OWC3MX433OR2EZXRODMAANI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SC7OWC3MX433OR2EZXRODMAANI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SC7OWC3MX433OR2EZXRODMAANI/action/storage_attestation","attest_author":"https://pith.science/pith/SC7OWC3MX433OR2EZXRODMAANI/action/author_attestation","sign_citation":"https://pith.science/pith/SC7OWC3MX433OR2EZXRODMAANI/action/citation_signature","submit_replication":"https://pith.science/pith/SC7OWC3MX433OR2EZXRODMAANI/action/replication_record"}},"created_at":"2026-05-20T00:02:59.585607+00:00","updated_at":"2026-05-20T00:02:59.585607+00:00"}