{"as_of":"2026-08-07T19:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:165b45f55f520d79f479c086c0b7fd4a220a27cba585a18fba64bf7fddde3033","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:56:22.025295Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-10T19:33:26.477847Z","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-10T22:50:48.610561Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"cited_work":{"arxiv_id":"2507.01468","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.01468","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kleftogiannis and I","venue":null,"work_id":"9ece5b28-8615-4c4e-a791-039a5cf21f1b","year":2024},"citing_paper":{"arxiv_id":"2604.05494","last_updated":"2026-04-07T06:37:17Z","snapshot_observed_at":"2026-07-06T22:54:12.531121Z","submitted_at":"2026-04-07T06:37:17Z","title":"Mass generation in graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T19:33:26.477847Z"},"links":{"cited_paper":"/paper/2507.01468","citing_paper":"/paper/2604.05494"},"observation_digest":"sha256:e495b5cfab336f67dea9fc796b43f346f9f069a0926facb8b70b722f1878a03a","observation_id":"b527872a-f8b3-4ca6-9b9b-ecb15a5f5839","resolution":{"observed_at":"2026-05-10T22:50:48.612326Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.01468/citation-record","integrity":"/paper/2507.01468/integrity","json":"/paper/2507.01468/citation-record.json","paper":"/paper/2507.01468"},"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-06T20:56:22.413393Z","title":"Kleftogiannis and I","venue":null,"work_id":"78f60042-f12e-452b-be76-c6a27d04103e","year":2022},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.523486Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:0543120e253cfdcfbcae8518238cbd17aca6dcc01f28b11db159a77456d5e9e1","observation_id":"435131a6-5504-42d9-aafe-6541b26e5dc6","resolution":{"observed_at":"2026-08-06T20:56:22.418415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00963","last_updated":"2024-05-13T08:15:39Z","snapshot_observed_at":"2026-07-06T13:59:04.148900Z","submitted_at":"2022-10-03T14:24:24Z","title":"Emergent spacetime from purely random structures","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00963","snapshot_observed_at":"2026-08-06T20:56:21.592476Z","title":"Kleftogiannis and I","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.592476Z"},"links":{"cited_paper":"/paper/2210.00963","citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:1b03e8ecb2ddd57d62cfd69015170f7cc87dcf127388e9233ff8e02697059ede","observation_id":"4ec27a24-23a5-4870-9592-85b62b25a38e","resolution":{"observed_at":"2026-08-06T20:56:21.592476Z","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-06T20:56:22.398566Z","title":"Quantum Grav","venue":null,"work_id":"1f2d384b-addb-414b-90b9-bf38091a4899","year":2011},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.728833Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:39cf74ec23c031fcbfb3c86e3e6c104b4ed286ff1d66990a7efb01b119bcb57b","observation_id":"e7786e91-b5cf-498a-b4a6-847066aa7e0d","resolution":{"observed_at":"2026-08-06T20:56:22.403050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.383621Z","title":"Rovelli, Living Rev","venue":null,"work_id":"6d68c285-3895-4d6e-983c-fb122c8f83e8","year":2008},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.901835Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:13387431e68d7759ba5c998c9bc9407c015a50d6353d1e34c3e83f18a05b6af9","observation_id":"9e0edf06-ace1-44fd-ad72-2a4180d72bd9","resolution":{"observed_at":"2026-08-06T20:56:22.388243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.366626Z","title":"Bombelli, J","venue":null,"work_id":"07b978c1-bbfc-4dc1-a315-1128c59e2d99","year":1987},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.926165Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:049beba3d3ccc35abc1e52093f218c8dc98b9ab5ac36034530a02c89a7ed9a83","observation_id":"58f7fd95-fd99-4311-b497-9dde2d46329c","resolution":{"observed_at":"2026-08-06T20:56:22.372244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:21.931030Z","title":"Dowker, Annals of the New York Academy of Sciences1326, 18-25, (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.931030Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:5b082e702573fe79b02d93bb524711288c1c54f097ff248fbfba15482dedaf53","observation_id":"c83d3477-f038-4cf4-9c35-af8f23a26f10","resolution":{"observed_at":"2026-08-06T20:56:21.931030Z","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-06T20:56:22.338472Z","title":"Dowker and S","venue":null,"work_id":"8db69505-ab08-407f-80ec-1fa400797620","year":2017},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.937047Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:294a641a97e2fbe11c6bf2fed7f95d1dc3d6cac9de37c0e4c9809d6acd2f4bd1","observation_id":"2ddc9789-baec-46c6-a415-58595efbf562","resolution":{"observed_at":"2026-08-06T20:56:22.342850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.11544","last_updated":"2019-08-28T05:56:27Z","snapshot_observed_at":"2026-07-06T07:42:02.964757Z","submitted_at":"2019-03-27T16:53:43Z","title":"The causal set approach to quantum gravity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.11544","snapshot_observed_at":"2026-08-06T20:56:21.941976Z","title":"Surya, Living Rev","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.941976Z"},"links":{"cited_paper":"/paper/1903.11544","citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:30d22160257425878fda5dc8687466429c5757880c51dbc00bac060ec437e187","observation_id":"d9630a95-8be4-40a7-9719-224f7a78bbd6","resolution":{"observed_at":"2026-08-06T20:56:21.941976Z","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-06T20:56:22.321344Z","title":"Wolfram, Complex Systems 29, (2) pp","venue":null,"work_id":"e90489f3-bbb5-4f82-8c28-dda980237643","year":2020},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.946849Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:2adbcd01d8431ee9418c8b5468bf0869288b86b9b90243659df30e592b12babb","observation_id":"e255842c-0bbf-4ccb-9a47-e14724b47c1d","resolution":{"observed_at":"2026-08-06T20:56:22.326994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.307023Z","title":"Gorard, Complex Systems, 29, (2) pp","venue":null,"work_id":"cea72f29-03ad-4bdb-a4a3-123f9191b7ac","year":2020},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.951774Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:c33badf2a8298ccd27956c1246579edffb0d6a668539c722e32bfaaab0c28605","observation_id":"08a04461-ca4f-40f6-bdbb-6bc885f4aff8","resolution":{"observed_at":"2026-08-06T20:56:22.311468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.292666Z","title":"Konopka, F","venue":null,"work_id":"bc02afd2-c1b1-471a-b024-a504f060748b","year":2008},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.956158Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:38ae98ffb896748fba7fda25b405611968b0187ee09fbf61a91a77f88d9849f0","observation_id":"a6ba4436-22c5-4a97-8a38-da5e7548d85c","resolution":{"observed_at":"2026-08-06T20:56:22.297374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:21.960867Z","title":"Trugenberger, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.960867Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:eab0a38f330ca3bb1e56dcf79171c55ce1b06da1c609402d22ce7517ad0c8bd1","observation_id":"7a67e5fb-7480-4df3-8390-831c6c3ff420","resolution":{"observed_at":"2026-08-06T20:56:21.960867Z","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-06T20:56:22.267525Z","title":"Kelly, C","venue":null,"work_id":"665a088a-606f-47e2-b75a-e7b556639e03","year":2021},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.965539Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:73ebd92148c9241c03c3893f0e4fac767a6a8de49798e2a5bb0b6d1232d2eab0","observation_id":"1b43d4ed-3394-4918-a5fb-65fda7d70e95","resolution":{"observed_at":"2026-08-06T20:56:22.272828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.251732Z","title":"Erd ˝os, T","venue":null,"work_id":"b7ce6bb2-31f7-4550-ba96-8a004d433463","year":1960},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.971012Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:66069a7527fb9abc3a841f5eafd6577fe4e1465e470e0dd57435cec059268668","observation_id":"e9e7214a-fed6-4a1a-a6fd-efcf41d36dfa","resolution":{"observed_at":"2026-08-06T20:56:22.257381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.237230Z","title":"Aigner, E","venue":null,"work_id":"be0e7b81-feea-42d7-91f6-b1fb3ccab82c","year":1994},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.975670Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:66ce38724e2a38df0d329b5201cc5f44fa3ddc94519cf348643ced8cf622a185","observation_id":"9da8c389-0384-4716-b358-8e3c8e2a8a49","resolution":{"observed_at":"2026-08-06T20:56:22.241890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.222218Z","title":null,"venue":null,"work_id":"1258721f-9996-47eb-b6c9-226347372ff1","year":2001},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.980612Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:860c7b77ce308ed4cbfc6cf8a2b33b6e0fc9340583229c927b0e13d8e180ffef","observation_id":"9b77116f-58a0-4028-aa9b-a90fc13faa3e","resolution":{"observed_at":"2026-08-06T20:56:22.227035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:21.985852Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.985852Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:f56ef47606893a36301ad2d1a374651670d9d2c7a8d6025a931e94399853dedc","observation_id":"c8ca1171-68a9-45a1-b132-57aa231b7855","resolution":{"observed_at":"2026-08-06T20:56:21.985852Z","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-06T20:56:21.990236Z","title":"Frieze, M","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.990236Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:a70933158e5cdbad6e2a08a2aaa5856a3d545500878f8961e8832a71c4af8d62","observation_id":"66d914b4-ebd4-465e-874c-6dfe28e347e4","resolution":{"observed_at":"2026-08-06T20:56:21.990236Z","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-06T20:56:22.187755Z","title":"Berg and M","venue":null,"work_id":"9018ea6a-a807-40c5-ae34-99ea1e47a207","year":2002},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.995130Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:6ed004cbcd021b8f34300f0a5855e01bf413461179c4165518bdc55ed3f60706","observation_id":"5cffe748-7f46-4353-8660-70f54e28fc85","resolution":{"observed_at":"2026-08-06T20:56:22.192342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:21.999379Z","title":"Mizutaka and T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:21.999379Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:f011978ed95eaa885ccaefcc50acc5ea50331f662997c217e094239748b8cff7","observation_id":"73bb770e-1c9d-4804-a7d5-cf22766fb0e2","resolution":{"observed_at":"2026-08-06T20:56:21.999379Z","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-06T20:56:22.158334Z","title":"Dirac, Physikalische Zeitschrift der Sowjetunion, 5 Band,3, Heft 1 (1933)","venue":null,"work_id":"1246cd5c-6283-4872-b519-da74dacf1c00","year":1933},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:22.004663Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:165324bb8badeb414d05bf6d127dfedfabb7c145b1d5024d2866053c2b4a2be8","observation_id":"21f112f1-acca-4440-acf4-08b5139d8668","resolution":{"observed_at":"2026-08-06T20:56:22.164361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.143450Z","title":null,"venue":null,"work_id":"3bd0e4d9-a803-496e-8b90-b112965bfe56","year":1948},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:22.010055Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:c0bfbb72c73859fde4196967bf4a88bc6c209450c8ed892a21983301e85c0f25","observation_id":"7c51b9a9-7a9b-4d27-aab5-701bccbd37df","resolution":{"observed_at":"2026-08-06T20:56:22.148149Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.127292Z","title":null,"venue":null,"work_id":"952e53ff-cc23-4b66-b438-ff7d3cb01724","year":2005},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:22.014688Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:3d13e20d7491e69f10b68f5687cab7df8d641fec4fee75b2714d314a11ccb738","observation_id":"8df345ef-68a4-44e0-af34-bb3df0972bc4","resolution":{"observed_at":"2026-08-06T20:56:22.132322Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.111483Z","title":null,"venue":null,"work_id":"ebfeb1ea-5a13-401f-a6df-f9cc24f7c37c","year":1957},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:22.019700Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:84c3cccac7336e5683f74f71db4f4e81b97bd83d346353d196a264737834534a","observation_id":"0513dc31-f25f-49fe-a1ea-65ab1d4a4ad9","resolution":{"observed_at":"2026-08-06T20:56:22.116399Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:56:22.094259Z","title":"Schwinger, Quantum Kinematics and Dynamics (1st edition: Benjamin, 1970; 2nd edition: Addison-Wesley, 1991; 3rd edi- tion: Perseus Books Group, 2000)","venue":null,"work_id":"ffdbdec6-71bb-44eb-bc37-618a5b9bfd77","year":1970},"citing_paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:56:22.025295Z"},"links":{"citing_paper":"/paper/2507.01468"},"observation_digest":"sha256:4703e114bbe9994e4f99866a0d6c38ce981845cc8ea157f5d9fd518e92003ac6","observation_id":"4dfb4c1f-a154-4738-b16b-9a350e051132","resolution":{"observed_at":"2026-08-06T20:56:22.101118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.01468","last_updated":"2025-07-02T08:29:28Z","latest_version":1,"primary_category":"cond-mat.dis-nn","snapshot_observed_at":"2026-08-06T20:48:03.535001Z","submitted_at":"2025-07-02T08:29:28Z","title":"The principle of least action for random graphs"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":25},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2507.01468."}