{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:E3Y7XYDCXU2ZMASO4G4FYHNDJH","short_pith_number":"pith:E3Y7XYDC","schema_version":"1.0","canonical_sha256":"26f1fbe062bd3596024ee1b85c1da349fd9c3b80117bac7131e519d36b91b0d7","source":{"kind":"arxiv","id":"2507.01468","version":1},"attestation_state":"computed","paper":{"title":"The principle of least action for random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc","hep-lat","quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Ilias Amanatidis, Ioannis Kleftogiannis","submitted_at":"2025-07-02T08:29:28Z","abstract_excerpt":"We study the statistical properties of the physical action $S$ for random graphs, by treating the number of neighbors at each vertex of the graph (degree), as a scalar field. For each configuration (run) of the graph we calculate the Lagrangian of the degree field by using a lattice quantum field theory(LQFT) approach. Then the corresponding action is calculated by integrating the Lagrangian over all the vertices of the graph. We implement an evolution mechanism for the graph by removing one edge per a fundamental quantum of time, resulting in different evolution paths based on the run that is"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.01468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2025-07-02T08:29:28Z","cross_cats_sorted":["gr-qc","hep-lat","quant-ph"],"title_canon_sha256":"33c4d9812ddc55dc1f7a65ee743d51cd80e52c83c03b3d61cac4ff2b48f15140","abstract_canon_sha256":"1bbc0a65e71300a833ca915293daa60996337fd8efb47d5f2e4a499727bbdcb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:49.408306Z","signature_b64":"6zWQSBYVBS6vwlLlPsLwniUZxdL1TGuE5t34RTSYd1lLGHr7yYUfyUjwl9B/4z0TksyA0QffSb67XN/7+SoCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26f1fbe062bd3596024ee1b85c1da349fd9c3b80117bac7131e519d36b91b0d7","last_reissued_at":"2026-07-05T11:30:49.407803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:49.407803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The principle of least action for random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc","hep-lat","quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Ilias Amanatidis, Ioannis Kleftogiannis","submitted_at":"2025-07-02T08:29:28Z","abstract_excerpt":"We study the statistical properties of the physical action $S$ for random graphs, by treating the number of neighbors at each vertex of the graph (degree), as a scalar field. For each configuration (run) of the graph we calculate the Lagrangian of the degree field by using a lattice quantum field theory(LQFT) approach. Then the corresponding action is calculated by integrating the Lagrangian over all the vertices of the graph. We implement an evolution mechanism for the graph by removing one edge per a fundamental quantum of time, resulting in different evolution paths based on the run that is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01468","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.01468/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.01468","created_at":"2026-07-05T11:30:49.407870+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.01468v1","created_at":"2026-07-05T11:30:49.407870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01468","created_at":"2026-07-05T11:30:49.407870+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3Y7XYDCXU2Z","created_at":"2026-07-05T11:30:49.407870+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3Y7XYDCXU2ZMASO","created_at":"2026-07-05T11:30:49.407870+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3Y7XYDC","created_at":"2026-07-05T11:30:49.407870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05494","citing_title":"Mass generation in graphs","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH","json":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH.json","graph_json":"https://pith.science/api/pith-number/E3Y7XYDCXU2ZMASO4G4FYHNDJH/graph.json","events_json":"https://pith.science/api/pith-number/E3Y7XYDCXU2ZMASO4G4FYHNDJH/events.json","paper":"https://pith.science/paper/E3Y7XYDC"},"agent_actions":{"view_html":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH","download_json":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH.json","view_paper":"https://pith.science/paper/E3Y7XYDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.01468&json=true","fetch_graph":"https://pith.science/api/pith-number/E3Y7XYDCXU2ZMASO4G4FYHNDJH/graph.json","fetch_events":"https://pith.science/api/pith-number/E3Y7XYDCXU2ZMASO4G4FYHNDJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH/action/storage_attestation","attest_author":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH/action/author_attestation","sign_citation":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH/action/citation_signature","submit_replication":"https://pith.science/pith/E3Y7XYDCXU2ZMASO4G4FYHNDJH/action/replication_record"}},"created_at":"2026-07-05T11:30:49.407870+00:00","updated_at":"2026-07-05T11:30:49.407870+00:00"}