{"as_of":"2026-08-24T01:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:18f62a23ac43135cf6a10174be7f1ca117cbb48de34146a8673e3296df513729","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:25:59.044751Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2412.17648/citation-record","integrity":"/paper/2412.17648/integrity","json":"/paper/2412.17648/citation-record.json","paper":"/paper/2412.17648"},"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-11T05:26:01.447317Z","title":null,"venue":null,"work_id":"561cc83c-e21d-4a5e-964d-a77b65e5007c","year":2019},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.324751Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:e5935c3f01532c07d30e275d15ba5142e45b1c3fb9ad4e35c11b0f7a3e43df88","observation_id":"e32cd01f-ce12-4727-acab-75755bbcf592","resolution":{"observed_at":"2026-08-11T05:26:01.484838Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T05:25:58.364855Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.364855Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:7acc695c5c9264123e68a2f5f9323444e029e8f097269cc5bcb42e36c970c57b","observation_id":"05dcd1dd-66d1-41cb-a49e-75b15d9c01de","resolution":{"observed_at":"2026-08-11T05:25:58.364855Z","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-11T05:26:01.266118Z","title":null,"venue":null,"work_id":"72e38ab1-8701-433d-a08b-4589e416489c","year":1977},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.414881Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:6439674fdedf6bde448fb1e55c95d3c049fee4bdd90fd9be865fc4c0fb072de1","observation_id":"20384723-11a5-4142-9a98-44159e58f81f","resolution":{"observed_at":"2026-08-11T05:26:01.296596Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T05:26:01.114748Z","title":null,"venue":null,"work_id":"5f1ab3da-5da3-4e63-a815-6d40e1d6ffe5","year":2004},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.454754Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:d43029ad5b72fe05077903c5e92e24b0b80e401618115e1c050f0ec12e478d6c","observation_id":"df844523-40fc-4ad1-8375-2e5878493b69","resolution":{"observed_at":"2026-08-11T05:26:01.193328Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T05:26:00.964177Z","title":"Habib and C","venue":null,"work_id":"b5c6d0d4-e422-464d-96a7-013532894886","year":2010},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.494893Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:48ff49d0275a08bc38dc9a5d3b42c06b0151b2b6a0965db4f3b1201c01f51610","observation_id":"2a653d4a-ffdf-456f-89ca-fb3c95ace683","resolution":{"observed_at":"2026-08-11T05:26:00.994749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T05:26:00.845822Z","title":null,"venue":null,"work_id":"2000b399-6420-433b-9efe-32de07c7b40f","year":2011},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.534849Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:1462c47ac1e051c2b27d765051309d2aa7a7e9928c4224120d645452bb6a304e","observation_id":"0b24844d-7490-4d9c-b3e4-c677b8d3ad00","resolution":{"observed_at":"2026-08-11T05:26:00.884848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T05:26:00.711306Z","title":null,"venue":null,"work_id":"1be5d0ae-68a9-45f3-b36f-45d3f4a91581","year":2016},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.574189Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:57aca54b589a41b5cca348f7452c0505400928dfe476906c364194be57e100f7","observation_id":"3fcf66ac-3fd5-4639-ac0a-846174ab2d37","resolution":{"observed_at":"2026-08-11T05:26:00.744746Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T05:25:58.604796Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.604796Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:22601154e21fa1f425855dcf6998362aeba9419eaef5e2b1b0f13845f4d19421","observation_id":"b44e31f9-7e3a-43eb-80b1-842ee403c4c7","resolution":{"observed_at":"2026-08-11T05:25:58.604796Z","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-11T05:25:58.644847Z","title":"Kitaev and V","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.644847Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:16314b8b8f8affefff6b0e6a4f0079bb90642ff96561a73bb74e2e89371cf8a8","observation_id":"8ea8f9c6-f16a-468f-a613-34ffd14893da","resolution":{"observed_at":"2026-08-11T05:25:58.644847Z","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-11T05:25:58.684755Z","title":"Kitaev and A","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.684755Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:94cc2b0b283a233b7144f7c632e1117391a258379b31447bf481f7cfce2fad2e","observation_id":"2d1ce0f7-5485-431e-aa98-aa370bc3cad6","resolution":{"observed_at":"2026-08-11T05:25:58.684755Z","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-11T05:25:58.734842Z","title":"Kitaev and S","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.734842Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:0903d52ab45c03c1fb78947a3db74ec656d06bf94c4b816b1648e957777f5e44","observation_id":"c2f035a4-39fd-4626-b316-9259db0ae090","resolution":{"observed_at":"2026-08-11T05:25:58.734842Z","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-11T05:26:00.028283Z","title":"Kitaev and H","venue":null,"work_id":"5c10bf0a-496d-486d-bf4c-0d91fac5c9cd","year":2024},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.774895Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:dcf83265998e22abdccd8fb94abff3937b8cb00f9c93d03c0c69303024c510dc","observation_id":"a1ec19bf-dfca-412d-ba76-9e72e1f3d37e","resolution":{"observed_at":"2026-08-11T05:26:00.106149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T05:25:59.879642Z","title":null,"venue":null,"work_id":"7b9d9abb-b741-488c-8d26-f1ef961861ea","year":1994},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.824754Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:374097381e08e95cb138e1167ce1edd5d4b3f9d742da7ea220b7053376f3e4ec","observation_id":"02146fb2-e9f6-4a6b-98c5-70b39ce368b1","resolution":{"observed_at":"2026-08-11T05:25:59.914969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T05:25:59.724762Z","title":null,"venue":null,"work_id":"1889b2ed-f4a9-4821-9e62-6d0d65c47eef","year":1984},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.884752Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:ca2727633b5d20a3de7601efe20240aecdab8b95532b847785751593863a9ecc","observation_id":"80d94955-4562-4c72-80ae-1d85f98ba65a","resolution":{"observed_at":"2026-08-11T05:25:59.764847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.00301","last_updated":"2023-09-29T19:18:19Z","snapshot_observed_at":"2026-08-17T15:00:17.246938Z","submitted_at":"2023-07-01T11:06:59Z","title":"Words for the Graphs with Permutation-Representation Number at most Three","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.00301","snapshot_observed_at":"2026-08-11T05:25:58.944751Z","title":"Mozhui and K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.944751Z"},"links":{"cited_paper":"/paper/2307.00301","citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:356f953be99df6aeb84ea5dffbe80938cfc41c9626d69739e1262f43bf68b0eb","observation_id":"e99dd452-aff5-4ebd-9854-ab9cfbcc20ca","resolution":{"observed_at":"2026-08-11T05:25:58.944751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13980","last_updated":"2023-11-23T12:52:09Z","snapshot_observed_at":"2026-08-23T10:12:13.652024Z","submitted_at":"2023-11-23T12:52:09Z","title":"On the Permutation-Representation Number of Bipartite Graphs using Neighborhood Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.13980","snapshot_observed_at":"2026-08-11T05:25:58.994756Z","title":"Mozhui and K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:58.994756Z"},"links":{"cited_paper":"/paper/2311.13980","citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:17b30440b3642a9129866f42ad94ab3a2f21c2eda9875651d67e7e15c923f660","observation_id":"4f178421-6f0b-4fc0-8a2f-2072e256186e","resolution":{"observed_at":"2026-08-11T05:25:58.994756Z","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-11T05:25:59.044751Z","title":"Yannakakis","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T05:25:59.044751Z"},"links":{"citing_paper":"/paper/2412.17648"},"observation_digest":"sha256:085b452a1faaf8faeedb0960f496f628a867bb27b117f3c96eb17ff0a76d13ea","observation_id":"c462a7bc-5974-46d7-8e97-22fb60fab16b","resolution":{"observed_at":"2026-08-11T05:25:59.044751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.17648","last_updated":"2024-12-23T15:24:05Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-23T13:00:15.597565Z","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":17},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2412.17648."}