{"as_of":"2026-08-13T02:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4aa6f4ad6f87e92396008eb4171cb2c69e09e156b74a05c0a889f5f0e0b5bd88","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:33:00.905686Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T11:07:49.160775Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.07951","snapshot_observed_at":"2026-08-03T11:07:49.160775Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29236","last_updated":"2026-07-31T10:12:24Z","snapshot_observed_at":"2026-08-07T10:40:42.757066Z","submitted_at":"2026-07-31T10:12:24Z","title":"Enumeration and Classification of Triangle-Maximal Pseudoline Arrangements","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T11:07:49.160775Z"},"links":{"cited_paper":"/paper/2507.07951","citing_paper":"/paper/2607.29236"},"observation_digest":"sha256:cca8d5f504f7e043d88f0b216102639663c1daf001b08069c13415beb4cfc663","observation_id":"afbfedb3-1447-4271-ac1a-7d8a393a6d33","resolution":{"observed_at":"2026-08-03T11:07:49.160775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.07951/citation-record","integrity":"/paper/2507.07951/integrity","json":"/paper/2507.07951/citation-record.json","paper":"/paper/2507.07951"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:04.186405Z","title":"chapter 5, page 126","venue":null,"work_id":"b311051d-8c63-40ec-8b22-faddfefa2db9","year":2017},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.438690Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:20ba157beee875aefcc8e90b3509e202cd349f8ee0269ff9667388d6f034c880","observation_id":"bd70e0a3-1815-44bd-b3e7-28958d773750","resolution":{"observed_at":"2026-08-06T18:33:04.298548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:03.938243Z","title":"Kobon triangles","venue":null,"work_id":"98325ec3-91b8-47f5-8176-4d0ff2ff6af7","year":2025},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.481587Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:2fc840e0f046f444183043fbe4892f2024e5b79be5be71858a5c0d908e749346","observation_id":"a3ab2022-bd7c-4a79-b404-879878dcd29a","resolution":{"observed_at":"2026-08-06T18:33:04.049480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:03.716412Z","title":"On simple arrangements of lines and pseudo-lines in P2 and R2 with the maximum number of triangles","venue":null,"work_id":"a745ff83-7db5-41a0-9ebb-57e6304d93da","year":2007},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.536700Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:2c510af14c569f9eba38a5ff4a565897a86b90ffde3ee9502b33a4fc386e5725","observation_id":"517dd084-ca66-4942-9a00-00ac5fac2934","resolution":{"observed_at":"2026-08-06T18:33:03.844369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:03.482840Z","title":"arminbiere/kissat","venue":null,"work_id":"d1a20e0e-52c6-48fe-ad86-e4067b432458","year":2025},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.596497Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:c2cf3516fd376903f13117e7b30c5d075bd313b8d87275865a8bb2107630cf18","observation_id":"d6fd29ee-855f-4ade-b332-b4d016a1dacc","resolution":{"observed_at":"2026-08-06T18:33:03.585518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:03.270424Z","title":"Cl´ ement and J","venue":null,"work_id":"43d17890-17e3-41b7-8cde-48cd787b2f81","year":2007},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.662066Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:e40cef9437753d39b16c09552ee132c6cb20742d0861b5e1fc3972e825e97fb5","observation_id":"6a9857ae-8742-4b6f-acda-ec39c808ef66","resolution":{"observed_at":"2026-08-06T18:33:03.368860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:03.081104Z","title":"Complete enumeration of small realizable oriented matroids","venue":null,"work_id":"e9a0ff40-7fb4-40a3-a8a7-6f13e0d38541","year":2013},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.711830Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:15630ef0d0d02f69cdc9d46961d4c100f9de9f09cb4a671f3a0f16712beb44d1","observation_id":"288c877b-7a5f-47ef-ac0b-b04ce67589a9","resolution":{"observed_at":"2026-08-06T18:33:03.169679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:02.879290Z","title":"Harris, K","venue":null,"work_id":"91423112-9037-4881-a508-7a239ce9839e","year":2020},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.774879Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:6de9e56cda162729920bfbff4f59742f65c72aa7b1070cc85c1bdd45556978e8","observation_id":"e4ab1576-4699-42cf-914f-4c8a1f2787d2","resolution":{"observed_at":"2026-08-06T18:33:02.965297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:32:59.825527Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.825527Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:fd5f40778150130568c4bdf6fe56e30c8f8d0c0a5390f6906669c8cfd80ee13b","observation_id":"dce5d38a-28a5-4026-9cd9-a7829438af62","resolution":{"observed_at":"2026-08-06T18:32:59.825527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:02.708253Z","title":"SAT-Based Generation of Planar Graphs","venue":null,"work_id":"29e93caf-5dbf-48fc-ac0e-6f33796f7e51","year":2023},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.904216Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:e715f2b6cfa42aa59ea4c48128db1f6986211a4b95a20653d68a4e52d0237050","observation_id":"33c61ede-a472-4dc4-b284-6de405600a80","resolution":{"observed_at":"2026-08-06T18:33:02.805437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:32:59.975128Z","title":"The On-Line Encyclopedia of Integer Sequences, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:59.975128Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:f12b118ca5b81307daa9d9f10a6082ffb410b5cf0e2bb206177e0e446bbd2bec","observation_id":"688e75d3-e16d-4b8c-be44-eca61e37db58","resolution":{"observed_at":"2026-08-06T18:32:59.975128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:02.557216Z","title":"The most general position","venue":null,"work_id":"b22074e9-1e5b-4ef5-bde9-cc7586d7e611","year":2015},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:00.032246Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:1c01a914755e1e6f8fb8960d22312c486f678e7ddc164032ee3ee9e469151ded","observation_id":"76094b3c-4977-4685-9161-b6026e39a524","resolution":{"observed_at":"2026-08-06T18:33:02.642133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:02.318466Z","title":"NumPSLA: An experimental research tool for pseudoline arrangements and order types","venue":null,"work_id":"33759da5-8cf0-43c7-bd77-c433619772f7","year":2024},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:00.126258Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:7f748021125a18a3fb21b9b94ed540404916d9e7168644a35f2ecdacc80fb7be","observation_id":"51e1cd89-6929-424c-9b98-3feafadda85f","resolution":{"observed_at":"2026-08-06T18:33:02.449856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02336","last_updated":"2025-03-04T06:55:18Z","snapshot_observed_at":"2026-08-07T17:31:22.742445Z","submitted_at":"2025-03-04T06:55:18Z","title":"NumPSLA -- An experimental research tool for pseudoline arrangements and order types","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02336","snapshot_observed_at":"2026-08-06T18:33:00.257333Z","title":"Numpsla – an experimental research tool for pseudoline arrangements and order types","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:00.257333Z"},"links":{"cited_paper":"/paper/2503.02336","citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:cac2d6ee01193eae3d36f8dc98a1ff7fc512025bbdd6017031ac30d9e6f278b8","observation_id":"b13c4c4f-e3c7-40b8-8c94-267749929edf","resolution":{"observed_at":"2026-08-06T18:33:00.257333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:02.127831Z","title":"Lineorder - a tool for finding straight line arrangements from pseudolines and generating svg visuals","venue":null,"work_id":"95e5a739-c530-49b6-989f-5d269789758b","year":2025},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:00.301883Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:1e02b294f99c2684f5ab523c54fb3cba45cb1744bae6da998cb346db86710002","observation_id":"2f73bec5-33df-473e-b5ce-ad1d5fd4f87d","resolution":{"observed_at":"2026-08-06T18:33:02.212240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:01.924192Z","title":"Sat-based solver for the kobon triangle problem using kissat and lineorder","venue":null,"work_id":"8c305fd8-fa65-4fe8-8b54-433ba0545b83","year":2025},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:00.448137Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:d646793704c430cc29eeecffd897447b781b9bd29b78cd2fd8070520075c1fd8","observation_id":"2e3b3c5f-147e-4a53-8a73-df5c592da3df","resolution":{"observed_at":"2026-08-06T18:33:02.034576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:01.694779Z","title":"Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, St´ efan J","venue":null,"work_id":"1067d060-142f-4659-b918-d9e544d675b5","year":2020},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:00.589504Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:791ea568fc66ccaea6965366e43910a91f3c49db100328d2ef10a8adf89e8c91","observation_id":"06e5eef1-4d8f-486c-abd7-30b5300bff86","resolution":{"observed_at":"2026-08-06T18:33:01.806665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:01.285483Z","title":"Weisstein","venue":null,"work_id":"5fb9d61b-38ab-4ae6-8ccd-cc6b45d70bb2","year":2025},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:00.724443Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:e4b6a5c83f22499c01da3ba59cf1180923c138a449462ad0b89da60751602ac6","observation_id":"2c912cda-dac2-4595-bbd5-de5cb91b901c","resolution":{"observed_at":"2026-08-06T18:33:01.554541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:33:01.059375Z","title":"Kobon triangle problem — Wikipedia, the free encyclopedia","venue":null,"work_id":"ce973f54-6763-49de-a1b8-16678e51d4a5","year":2025},"citing_paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:00.905686Z"},"links":{"citing_paper":"/paper/2507.07951"},"observation_digest":"sha256:674f940eae458292a5783a02f4fb25fbf4331e0e7faea05c483367b704628907","observation_id":"36040dca-699c-4113-a9d5-7be56a6cb6b1","resolution":{"observed_at":"2026-08-06T18:33:01.139898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.07951","last_updated":"2025-07-10T17:36:32Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-11T08:59:06.920694Z","submitted_at":"2025-07-10T17:36:32Z","title":"Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":18},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:2507.07951."}