{"as_of":"2026-08-08T07:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bad7c0b5c0e66ed51d86808dfd09d3b1ccf4cbac284911e53ded44407ae3e78b","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:53:36.180956Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2506.01589/citation-record","integrity":"/paper/2506.01589/integrity","json":"/paper/2506.01589/citation-record.json","paper":"/paper/2506.01589"},"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-07T11:53:39.323408Z","title":null,"venue":null,"work_id":"05ea3faa-2b51-4ced-a0ad-06f3052a2269","year":1999},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:35.309046Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:d2f71f85e78f3c418fbe7dfcacacab74f4bc5ed9b3179e49a71a8ea449225ca4","observation_id":"eae66131-38a5-4849-908b-5b143be2635b","resolution":{"observed_at":"2026-08-07T11:53:39.476925Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:39.055712Z","title":"(2017).Triangle-free penny graphs: degeneracy, choosability, and edge count.In International Symposium on Graph Drawing and Network Visualization (pp","venue":null,"work_id":"1742aa12-1291-4c59-9cf0-5b57437839dc","year":2017},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:35.401898Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:b9279fcdca98999dfedf8a07ebed2a9c07128a80843365f3632db07bcf6bc9d6","observation_id":"97da7298-76f3-41db-a748-1ee35467f41d","resolution":{"observed_at":"2026-08-07T11:53:39.209298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:38.771141Z","title":"(1946).On sets of distances ofnpoints.The American Mathematical Monthly, 53(5), 248–250","venue":null,"work_id":"55393b88-3ff6-4f91-9dc4-a08e124df180","year":1946},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:35.484677Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:01caf6402ddbd10c433e7fa211fa44a97e3977c40cc786bc51086937e68ac4c3","observation_id":"faea6bf3-4f8f-4076-9e2d-459343649553","resolution":{"observed_at":"2026-08-07T11:53:38.894106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:38.453890Z","title":"(2024).1-planar unit distance graphs.In 32nd International Sympo- sium on Graph Drawing and Network Visualization","venue":null,"work_id":"acc1da68-36ea-433d-ba25-4a4aff9d8498","year":2024},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:35.550768Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:6efe4a7565b0efbd1e32699bc603edbee08953f413ae82fc4255003e755c0be5","observation_id":"3e69579c-033b-45ac-8656-80a5e5970bb3","resolution":{"observed_at":"2026-08-07T11:53:38.634808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:38.018610Z","title":"(1974).Solution to problem 664A.Elemente der Mathematik, 29, 14–15","venue":null,"work_id":"69cd035d-54bd-4365-8840-c00191c6f1cf","year":1974},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:35.628755Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:31e9ef5e39fde5e209ee5f55d0676e4ecc404102684bccec26cf3673378cae06","observation_id":"df4b1494-0ebf-4485-9fea-df199a9ace49","resolution":{"observed_at":"2026-08-07T11:53:38.222333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:37.640872Z","title":null,"venue":null,"work_id":"d6c8404b-c2c8-450e-871b-a611c5156e13","year":1981},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:35.719534Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:1f5188d03b63854ddbebf5290b4a519ca3bd609047d39292c31878ec75836592","observation_id":"cf019548-75ff-4d6d-aa9e-630942b5415a","resolution":{"observed_at":"2026-08-07T11:53:37.792265Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:37.333478Z","title":"(1994).Match sticks in the plane.In The Lighter Side of Mathematics","venue":null,"work_id":"77bfe8a0-4039-4d7d-817a-90c9dfc23432","year":1994},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:35.858253Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:05effae9195cb9cbbcefad44da39eea5d8f6a906c39706c12f62bf89d71b620b","observation_id":"0caf185f-5a56-4953-9408-c54ed125c38c","resolution":{"observed_at":"2026-08-07T11:53:37.471802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:37.085734Z","title":"(1992).Tiling polygons with parallelograms.Discrete and Com- putational Geometry, 7(2), 175–188","venue":null,"work_id":"22f5641b-5714-44dd-916a-69618cd537f4","year":1992},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:35.924272Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:65f50547f5be7ae3ef1d0173819d67f7a7d216aaa860e8c5e0a1c6a4db7517b7","observation_id":"4037dca4-739a-47a2-81f3-d5219819aee3","resolution":{"observed_at":"2026-08-07T11:53:37.206276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:36.870549Z","title":"(1993).Tiling a polygon with parallelograms.Algorithmica, 9, 382–397","venue":null,"work_id":"228222e1-5f6f-4d89-a272-d20d19678cbc","year":1993},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:36.004863Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:e474d8c3571f2e1ba04ec1a853bf7c6a7abe392cb2e6e10a92d29b13c845d8b6","observation_id":"ddb07efb-79f1-4808-af9d-4c6226ae6cfb","resolution":{"observed_at":"2026-08-07T11:53:36.964184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:36.499980Z","title":null,"venue":null,"work_id":"7dd2bf48-c1eb-474f-9fd2-ee4225a03137","year":2024},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:36.083148Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:28b3c9300a55b7454fe876a7d114415a918affe31e266c57289662b9bde1fefe","observation_id":"f9d8906e-859f-47c2-91f3-f6ee637636c2","resolution":{"observed_at":"2026-08-07T11:53:36.679278Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:53:36.347334Z","title":null,"venue":null,"work_id":"2fd98e9f-d2b3-41c1-bcb1-26a026624bf2","year":2009},"citing_paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:53:36.180956Z"},"links":{"citing_paper":"/paper/2506.01589"},"observation_digest":"sha256:91cf38b2f73a7428196abc36bcddf9aa316ad9b6253b77f70da3112d77163f50","observation_id":"1cc9b507-eeb2-44e2-8a51-ac916bb7a045","resolution":{"observed_at":"2026-08-07T11:53:36.377522Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01589","last_updated":"2025-06-02T12:22:32Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T18:20:10.683992Z","submitted_at":"2025-06-02T12:22:32Z","title":"On the number of edges of restricted matchstick graphs"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":11},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2506.01589."}