{"as_of":"2026-08-09T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28fd19166aa2efb75a8e6bf52422c76453d4dc8d2671b031e148dc5e2c5a85ce","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-09T06:31:02.800959+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-09T05:36:21.915977Z","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:86e6317a5b9b938e6560ed8b2e410f9783b126010361a4ef1d44a6162b0474ab","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:c64060af53870b103b3accd050e48cd3e068e52401f01fbafd513f59ac3f4eb7","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:c6ccddb86547f64d4c5f551169690a8856112c884bfd4030594323dbf0e213a0","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-09T05:36:21.915977Z","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:c9f5af01ac1702c9a82a5cc80651d89301314f4c724a9f1509451ebe3e5022d4","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:bf0cc6d9f7ea0166cf14705148232e32c65fe5eec71f58b1c7c1d3a8ca2a1d8e","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:9d72c1073812c23ca0616bf288eb69887fe1c056fa36575a21aaa28cd2647d3f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:01f07811e27885aef56344f653264674eeee87273174b8654d63c394e8c1ff02","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-09T05:36:21.915977Z","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:0f16ca6d61433f26cc22562f959cca1c1582e456b3e9f2cba8a835cdb2f75036","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T22:37:10.163551Z","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-09T05:36:21.915977Z","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:100fe3d7b623767b0c16d87bcaa85b88b68a7239490d4ce1b0cde67cf38d5cbe","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-09T05:36:21.915977Z","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:04e5a610e67fbec5a5df6c4d430d7d95c4d612ad071b366cf850365429f232c1","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:09c44e9833ce0be5c89e1ffd1e5338ba53a0b02221cef6011b18f72556dc219e","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:b4757d5a6360cfe583150dfb3301f2ff0171277d19f7ca38fc3ae4449e3e3f7a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:e67302c903caf2fc73e844a98b2d4613e56173615c21b8c7819c5c7eeee06b6c","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-09T05:36:21.915977Z","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:251810332e0f8454a3d65caec1e34675c40611180d581537223a04186ecd2ab8","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:8997654fe6cb91c443dba2435a3ba7a1ad37eab0851d91276e975b0ad8282a23","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:e7e5bb57188adbff3069a623f92bf05cd401f174b711d9d5c6e41f03c1fb56e5","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:93c60e4b6cf3f3cf31ea7bbd5adcfc6eab7bce3cd30f79785baac6531ed880e7","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:066afd465bf6324dcc041e85003790b2eca854fd72e411940fa8017b5b6de8bd","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-09T05:36:21.915977Z","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:c3af4cde8a6632fcf24f9e1c68549a6f62754d379f20564ae58f2547c4e60f4b","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-09T05:36:21.915977Z","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:212404b152059cd8df95d6452c9899ef7c5d968baa1927978f9810abae11b121","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:006771462b6943de809d83541602d68bbdc12551d8f8f3118c7ac3d4cbea36b0","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-09T05:36:21.915977Z","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:1d690a62a7f0640802a311348e8fde74090b3edb550f487c5aa8f057d9be8949","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:11305edc4d823391cb09553c1588fb1174e6e725b28ad11832b2e20b5d45b761","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:96024c7a7f5f435e2e3cb35f5b6070d91fc42c855a3633ebe9d91fce28422260","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:213f5b74bd5bc88e4074bcc4b5b52b3dda8a1bd48d8111834bd2f8ac543591ed","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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:ac6f3bc1859282d2daa8f12090334971ab3dc8f844031bf172c89fabfb6037be","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T05:36:21.915977Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2507.01468."}