{"as_of":"2026-08-21T06:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e4af4fabc813b673ca1cbd46fd816b07e417d0146212a88e3b3d926dfe33eb36","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:12:18.107887Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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-05-14T21:40:47.491357Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-14T21:43:00.724783Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"cited_work":{"arxiv_id":"2506.14042","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14042","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Subercaseaux","venue":null,"work_id":"bd9c1486-3d9c-408b-8246-246576dfa9cf","year":2025},"citing_paper":{"arxiv_id":"2603.27774","last_updated":"2026-04-17T23:27:26Z","snapshot_observed_at":"2026-08-11T09:48:45.308439Z","submitted_at":"2026-03-29T17:14:36Z","title":"Automated Reencoding Meets Graph Theory","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-14T21:40:47.491357Z"},"links":{"cited_paper":"/paper/2506.14042","citing_paper":"/paper/2603.27774"},"observation_digest":"sha256:e5a0cb570f8a3788f88078521d2700e18c01de2a35a17bfd4f9faa8ab0532fa5","observation_id":"4763e0c3-465d-468b-8920-70ed30d637ed","resolution":{"observed_at":"2026-05-14T21:43:00.726700Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.14042/citation-record","integrity":"/paper/2506.14042/integrity","json":"/paper/2506.14042/citation-record.json","paper":"/paper/2506.14042"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02579381","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Covering graphs by the minimum number of equivalence relations","venue":"COMBINATORICA","work_id":"07dbedb9-8074-47b3-b540-f6c12b8424cb","year":1986},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.907604Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:80478542864344db9135f91aad5d7ea22b5099bef2633495649d7d5db3bd1927","observation_id":"3b55024a-f557-48b6-b377-27b48e7fd264","resolution":{"observed_at":"2026-08-15T20:12:18.391072Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10601-010-9105-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-19T11:03:45.297681Z","title":"Cardinality Networks : A theoretical and empirical study","venue":"Constraints","work_id":"4b3672c7-2e27-4e2a-8bcb-e012f3433121","year":2011},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.914423Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:5daf785b93c14a2759cf8ced789b8e0b183ba7b369191b58f37fd1a8169bf4f6","observation_id":"832366cb-eb5c-46ea-83a5-b96b9f9aa38c","resolution":{"observed_at":"2026-08-15T20:12:18.372597Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:17.919945Z","title":"Computing NP-Hard Repetitiveness Measures via MAX-SAT","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.919945Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:1927740e35cd63388005998f56e5a5c9415a75bb30408d09ef60cfcebda6bc10","observation_id":"41707ed6-c1f1-432b-ba9e-e4b4832081fb","resolution":{"observed_at":"2026-08-15T20:12:17.919945Z","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-15T20:12:18.971094Z","title":"Computing NP-Hard Repetitiveness Measures via MAX-SAT (under review), 2025","venue":null,"work_id":"5d96489e-560a-4eb4-b194-ebb4923eb701","year":2025},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.925969Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:0dce533cb1930d4f09b727a87b964acb63fc1121eefb955689c6d83b2a9a0a05","observation_id":"57fcefe0-30de-4027-adb4-fb12fdfc2bf2","resolution":{"observed_at":"2026-08-15T20:12:18.978513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.952800Z","title":"exactly one clauses · I ssue \\#39 · arminbiere/kissat --- github.com","venue":null,"work_id":"5b55f426-466d-45c6-884f-6f7ff0b3872d","year":2023},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.931277Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:4218f4a8936daccb4858fbfbf82ec9c8a413497459110b46970e1d369734d03e","observation_id":"afc64521-7d33-4e1f-b1d0-f0734a077199","resolution":{"observed_at":"2026-08-15T20:12:18.958349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/sat190085","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:18.348291Z","title":"Successful SAT encoding techniques","venue":null,"work_id":"2a26f71c-dbda-49ea-9bc8-096821fa97d6","year":2011},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.936684Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:35716ff77d563c84fdc5bd81de9ce2f9e6fd94fd6e56cf607d6fb88411de58a0","observation_id":"f9218af0-cb67-43ff-a548-bd92d9fed14d","resolution":{"observed_at":"2026-08-15T20:12:18.354456Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.931817Z","title":"A new sat encoding of the at-most-one constraint","venue":null,"work_id":"c23eeb7e-66b3-46ac-b7f0-e8d970d612af","year":2010},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.943328Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:a88b8a48b9f0a9ebd3a920e45a741078d32610470edecd811fcf71e7877a6fa8","observation_id":"3165e823-1eba-4960-a616-e6d2a1dc16e9","resolution":{"observed_at":"2026-08-15T20:12:18.939187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:17.948722Z","title":"o zy, editors, Studies in Pure Mathematics : To the Memory of Paul Tur \\'a n , pages 95--101. Birkh \\","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.948722Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:68c53b3867faadec7b224d28b647540c315bf56fda67fe683c47bead86f33cba","observation_id":"001cf94c-085e-48e7-ab25-5e0284b21929","resolution":{"observed_at":"2026-08-15T20:12:17.948722Z","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":"1613.28518","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:18.729694Z","title":"Clique covering of large real-world networks","venue":null,"work_id":"fa1f85f1-4e1d-45f8-8642-35f819cd24ed","year":2016},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.955217Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:4d64477c8180ca8e504fecc7cc3da960653ebe69342399de6664ae6da9454641","observation_id":"093ded1d-17c3-4fef-8321-578e796fcd9a","resolution":{"observed_at":"2026-08-15T20:12:18.738122Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00373-007-0722-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"On the Decomposition of Graphs into Complete Bipartite Graphs","venue":"Graphs and Combinatorics","work_id":"b13ddcc6-e6f9-4eef-8b03-086871e090c1","year":2007},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.960416Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:2db93519625a31e7e46ddcf706d9fb2956fc1788cb4836cfc9d3a5dbfff44f6f","observation_id":"a82d16e1-7022-4bd2-a678-4eeece8940ba","resolution":{"observed_at":"2026-08-15T20:12:18.325421Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2022.47","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:18.300179Z","title":"Kulikov, Ivan Mihajlin, and Nikita Slezkin","venue":null,"work_id":"5ca89a03-ef7c-441f-91a3-83b9b2390e6e","year":2022},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.966268Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:22d113ae0097b62d213dd0e98207ec0f836725528f3ea79b82b9aadd00468cea","observation_id":"bf28625c-7536-4d1e-a401-f5dfa11fc927","resolution":{"observed_at":"2026-08-15T20:12:18.306674Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:17.971952Z","title":"Fishburn and Peter L","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.971952Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:ab89744f6a620701085ad5894f8049278a8137bbae1972b153b7d72b2571e79a","observation_id":"7a07df06-c3c6-4c66-b059-776b01a8f486","resolution":{"observed_at":"2026-08-15T20:12:17.971952Z","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":"10.1007/bf01192522","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Covering the edges of a random graph by cliques","venue":"COMBINATORICA","work_id":"08f654b9-0663-41a0-8731-4b4e718936de","year":1995},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.977038Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:872c2d870f940467bb54f35efc66d36165aff1e67d6713514515dc0d75d17a5d","observation_id":"d2e26f59-b48e-4219-96f1-33f5bb0d477b","resolution":{"observed_at":"2026-08-15T20:12:18.276645Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1103.4870","last_updated":"2011-03-24T20:19:43Z","snapshot_observed_at":"2026-08-15T04:51:22.447676Z","submitted_at":"2011-03-24T20:19:43Z","title":"Covering the edges of a random graph by cliques","version":1},"cited_work":{"arxiv_id":"1103.4870","doi":null,"metadata_source":"pith","pith_arxiv_id":"1103.4870","snapshot_observed_at":"2026-08-15T20:12:18.647305Z","title":"Covering the edges of a random graph by cliques","venue":"math.CO","work_id":"c0f40115-37d9-45c5-9479-2b92d8879cd4","year":2011},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.982441Z"},"links":{"cited_paper":"/paper/1103.4870","citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:bf994453e9b4da24da6f74181620f0fd5d94259b257d62411cad3c39688cc136","observation_id":"ac1b2175-fbe8-431a-b104-ebe213b0edcc","resolution":{"observed_at":"2026-08-15T20:12:18.656735Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:17.987621Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.987621Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:c85112297ee274bd06025dd5f4587feadf77f151cdd934d201ecefb97ae8b0cb","observation_id":"ddca5b7e-5a56-4585-bdd3-a02bf8b1c9c9","resolution":{"observed_at":"2026-08-15T20:12:17.987621Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:17.993353Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.993353Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:845459defa34ba3a7241965ae40d5e755251eebc0b5715b85e907d3f01e43d62","observation_id":"24464f83-4023-4845-bbfc-43d07367375e","resolution":{"observed_at":"2026-08-15T20:12:17.993353Z","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":"10.1145/2736696","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:18.230112Z","title":null,"venue":null,"work_id":"d47ee9fa-224b-4fcc-a2a4-360cbc4747df","year":2015},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.998656Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:437258d76adf537367742cb96e4b965df3b3e36f83b1c2d49467f7f44b7c8faa","observation_id":"776a831e-c572-4b6b-9f01-ea72ecbf2059","resolution":{"observed_at":"2026-08-15T20:12:18.235650Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.913491Z","title":"Is the smallest grammar problem over the singleton alphabet known to be np-complete or ...? Computer Science Stack Exchange, 2025","venue":null,"work_id":"884b3d7c-973a-4c04-939d-173135d49526","year":2025},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.004821Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:f08e0088cdbf2733d55e1776dfa336dcd9ef8cf8bde48fdbded57a2d94bb32fd","observation_id":"a580d387-61bd-465b-96ba-209a608e26ea","resolution":{"observed_at":"2026-08-15T20:12:18.919248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.894075Z","title":"Cardinality encodings for graph optimization problems","venue":null,"work_id":"c4aaf897-bb97-404f-9948-667e862da708","year":2017},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.010610Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:cb3da40bd1ca36f95fe1b241b82a9461a4d3d2ec93887a4c1a758c6157567671","observation_id":"7e1e2a41-0bd7-4ae6-941f-2f66970baea8","resolution":{"observed_at":"2026-08-15T20:12:18.900518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.017368Z","title":"Computational Complexity of Graphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.017368Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:a53d9a51ade68fcc718aca9cf3eface5141c871dd8b35b2355ae3d47616fd02f","observation_id":"8046e2f8-e294-424b-b26c-00c9324ca506","resolution":{"observed_at":"2026-08-15T20:12:18.017368Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:18.023242Z","title":"A lower bound on CNF encodings of the at-most-one constraint","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.023242Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:e6eeb78531ace1e0c0d345f5b0f93b4f33f69433c6c2e0bbaca8633a555f9b82","observation_id":"33bd71e6-fae3-4440-9a4e-054d7cb1f5b8","resolution":{"observed_at":"2026-08-15T20:12:18.023242Z","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-15T20:12:18.873498Z","title":null,"venue":null,"work_id":"1ef10079-f82d-4dc2-a3ad-71029573191b","year":2012},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.028402Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:d6923f4ca189b1ba7e074e65aae2b4ceb8bc9e8b77be60e0c23b7d990d43dc85","observation_id":"7c308426-9950-4db9-9959-3d46efd1109e","resolution":{"observed_at":"2026-08-15T20:12:18.879295Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.855594Z","title":"Timetabling based on sat encoding: a case study","venue":null,"work_id":"2346faa3-edd4-49d6-8684-7a9513022483","year":2008},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.033264Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:7a0b3f9462460a09ab0e9176904705261a477fa3fd3024cab82ab203363ab708","observation_id":"ff35df8c-93a0-4e32-98c6-f66c635f6601","resolution":{"observed_at":"2026-08-15T20:12:18.861512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.038927Z","title":"Efficient SAT encoding scheme for schedulability analysis of non-preemptive tasks on multiple computational resources","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.038927Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:f369ad9536b214310ce91c034444d4de6eb42066924696e392bdd4f056cbc717","observation_id":"1f33bdcd-7a3f-4e6e-a105-59f88cd92d49","resolution":{"observed_at":"2026-08-15T20:12:18.038927Z","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":"10.1016/j.ipl.2009.11.015","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:18.190761Z","title":"Finding bipartite subgraphs efficiently","venue":null,"work_id":"3b28820e-1a97-4da8-b549-47592e0a8beb","year":2010},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.043957Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:6e6c4856d5ccdba01d0c852de6fc42544b6e6d0f103e601ff5fd36902b624055","observation_id":"7442533a-1eb4-477b-ac38-ad0835f619a5","resolution":{"observed_at":"2026-08-15T20:12:18.197088Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6020.34261","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:18.552375Z","title":"Empirical study on sat-encodings of the at-most-one constraint","venue":null,"work_id":"673c3b78-d2a0-4764-8a35-ce0702b12b7c","year":2020},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.049229Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:a771d07c58ef57bf2fc97000f1922cdf943d85ff2d6463aab9eb8544bde73954","observation_id":"76513c6c-a266-49c1-8b5e-e7a990221ecd","resolution":{"observed_at":"2026-08-15T20:12:18.561957Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.837979Z","title":"C liquer homepage --- users.aalto.fi","venue":null,"work_id":"f62fb4dc-c7a9-4425-b33d-cf79143b54aa","year":2002},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.054967Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:5b8ae502f105c571b4291f0a7e482b827479f0087c806c9d747db49688abe9d0","observation_id":"65d14dd0-bd33-4c6b-a187-4ce6a49b8a17","resolution":{"observed_at":"2026-08-15T20:12:18.843671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/faia200985","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:12:18.169999Z","title":"CNF Encodings, chapter 2","venue":null,"work_id":"da90cd60-b8c2-49bf-a34f-10230d848eee","year":2021},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.060135Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:64b48577b79411a42cb0cb666e1249ec8b2d16f0300165c12b20b75d3a22fda6","observation_id":"b16ac632-5a86-4a04-b6d1-c36e601e8531","resolution":{"observed_at":"2026-08-15T20:12:18.176608Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01079","last_updated":"2025-06-01T16:30:07Z","snapshot_observed_at":"2026-08-17T19:35:48.804979Z","submitted_at":"2025-06-01T16:30:07Z","title":"Unfolding Boxes with Local Constraints","version":1},"cited_work":{"arxiv_id":"2506.01079","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.01079","snapshot_observed_at":"2026-08-15T20:12:18.440106Z","title":"Unfolding Boxes with Local Constraints","venue":"cs.CG","work_id":"f22dbe50-0fab-4048-a474-e64c65e9c12e","year":2025},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.065142Z"},"links":{"cited_paper":"/paper/2506.01079","citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:370f32c8cc032d96dbf9c5c908c1d8e24806907dba686ba54476ffa5bf59bad6","observation_id":"8afc2813-44dd-4030-9c26-87a0016f221a","resolution":{"observed_at":"2026-08-15T20:12:18.446915Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.821224Z","title":"Compact representation of sets of binary constraints","venue":null,"work_id":"eb2e36f8-7291-407f-a855-f8291044b4d2","year":2006},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.070658Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:4cfc2a1a6eb9cbad737b875f7338a91f1196ac36e5b6171434be5bb2184e5d6e","observation_id":"4437be84-d2bb-4fe1-be6b-32da490c255a","resolution":{"observed_at":"2026-08-15T20:12:18.826933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.075961Z","title":"SAT-based Decision Tree Learning for Large Data Sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.075961Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:bdc9ed04c529f4a01f67e2c0c8ac08d1bf9529f9519dc0a45e9c35016f8be1a7","observation_id":"a96b46c2-6474-4297-a754-ee14525e1799","resolution":{"observed_at":"2026-08-15T20:12:18.075961Z","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-15T20:12:18.801974Z","title":"Towards an Optimal CNF Encoding of Boolean Cardinality Constraints","venue":null,"work_id":"a2ed99db-c9fb-4ba1-8c0d-6dd7a9510a08","year":2005},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.081641Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:288bc4489e4aee65d99c07685965584337347d5adf9bf6f80088b3bf52345fc0","observation_id":"3785f0cd-0e9c-4eb7-8280-f9c27e5cdeb1","resolution":{"observed_at":"2026-08-15T20:12:18.807285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.087768Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.087768Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:bb7cb919173c978e3b072488e7609acecb8480af960b4454d8260f986aa6947c","observation_id":"cd39fce0-1547-44f5-84ef-3bd70898ea59","resolution":{"observed_at":"2026-08-15T20:12:18.087768Z","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-15T20:12:18.770583Z","title":"The Packing Chromatic Number of the Infinite Square Grid Is at Least 14","venue":null,"work_id":"77f25eaa-db1a-4ca6-a901-80f4d89034ba","year":2022},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.092761Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:2ab87f653b0d04a8be8f89cd6366294f0303eb62efe61292af0209155cd5d6f4","observation_id":"3264402b-d0fd-483e-8d63-9d696564cc20","resolution":{"observed_at":"2026-08-15T20:12:18.776179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.751797Z","title":null,"venue":null,"work_id":"acd2dcc6-dca8-4cdb-b423-67620aa1ac43","year":2024},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.097561Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:8e2ea6e33640e7b03c43553edbd591e86f3640f916c5945ab33a946ee36e984b","observation_id":"ef5ecd23-350b-4f19-87bf-3268dadcd92e","resolution":{"observed_at":"2026-08-15T20:12:18.757957Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T20:12:18.102840Z","title":"A review on algorithms for maximum clique problems","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.102840Z"},"links":{"citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:ae5010dfddc3d466ee0068d2c0381822f9417ce317d638fea5a40e47724dce2b","observation_id":"f37bb63f-385a-4b89-9f18-bbc938fd9137","resolution":{"observed_at":"2026-08-15T20:12:18.102840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.06274","last_updated":"2020-05-12T03:23:00Z","snapshot_observed_at":"2026-08-13T22:44:59.852691Z","submitted_at":"2020-05-12T03:23:00Z","title":"Yet Another Comparison of SAT Encodings for the At-Most-K Constraint","version":1},"cited_work":{"arxiv_id":"2005.06274","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.06274","snapshot_observed_at":"2026-08-15T20:12:18.410361Z","title":"Yet Another Comparison of SAT Encodings for the At-Most-K Constraint","venue":"cs.LO","work_id":"2ed96ce2-e044-490b-952e-3a88f4e9dbff","year":2020},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.107887Z"},"links":{"cited_paper":"/paper/2005.06274","citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:673b6c461b8d64d349fa9996d96abf3b863d95084b9b26d475c4c147bb0720a9","observation_id":"fc38e807-dc48-43e0-9485-e9884bd14262","resolution":{"observed_at":"2026-08-15T20:12:18.419788Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":13,"verified_exact":12,"verified_fuzzy":10},"total_outbound_references":37},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2506.14042."}