{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QEMTVRFWWIR5AZ2QDV3XPY3RPH","short_pith_number":"pith:QEMTVRFW","schema_version":"1.0","canonical_sha256":"81193ac4b6b223d067501d7777e37179e83272ee2d33c76b7367dc328e0b0cfc","source":{"kind":"arxiv","id":"1707.01901","version":3},"attestation_state":"computed","paper":{"title":"Entropy of Spatial Network Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT"],"primary_cat":"physics.soc-ph","authors_text":"Carl P. Dettmann, Justin P. Coon, Orestis Georgiou","submitted_at":"2017-07-06T09:11:09Z","abstract_excerpt":"We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly in space and links formed independently between pairs of nodes with probability given by a specified function (the \"pair connection function\") of their mutual distance. We consider the general case where randomness arises in node positions as well as pairwise connections (i.e., for a given pair distance, the corresponding edge state is a random variable). Cla"},"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":"1707.01901","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-07-06T09:11:09Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT"],"title_canon_sha256":"7a675096d8908c628d9ef05351c82d629503e20a64ce53fbb2021578969eec55","abstract_canon_sha256":"8866c5948f34d9af263e4b30484812c29172cdc51f94839ad95e89f3891e5015"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:09.201974Z","signature_b64":"nnqIbqQOGN+8BOXdIPDOKUm/CjnJMuq2SaGx60pUX0879J2tN/lqR0h7POJBGY7/vnmQoxy42Kj+/KJ5H3BQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81193ac4b6b223d067501d7777e37179e83272ee2d33c76b7367dc328e0b0cfc","last_reissued_at":"2026-05-18T00:17:09.201386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:09.201386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropy of Spatial Network Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT"],"primary_cat":"physics.soc-ph","authors_text":"Carl P. Dettmann, Justin P. Coon, Orestis Georgiou","submitted_at":"2017-07-06T09:11:09Z","abstract_excerpt":"We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly in space and links formed independently between pairs of nodes with probability given by a specified function (the \"pair connection function\") of their mutual distance. We consider the general case where randomness arises in node positions as well as pairwise connections (i.e., for a given pair distance, the corresponding edge state is a random variable). Cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01901","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1707.01901","created_at":"2026-05-18T00:17:09.201482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01901v3","created_at":"2026-05-18T00:17:09.201482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01901","created_at":"2026-05-18T00:17:09.201482+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEMTVRFWWIR5","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEMTVRFWWIR5AZ2Q","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEMTVRFW","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH","json":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH.json","graph_json":"https://pith.science/api/pith-number/QEMTVRFWWIR5AZ2QDV3XPY3RPH/graph.json","events_json":"https://pith.science/api/pith-number/QEMTVRFWWIR5AZ2QDV3XPY3RPH/events.json","paper":"https://pith.science/paper/QEMTVRFW"},"agent_actions":{"view_html":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH","download_json":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH.json","view_paper":"https://pith.science/paper/QEMTVRFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01901&json=true","fetch_graph":"https://pith.science/api/pith-number/QEMTVRFWWIR5AZ2QDV3XPY3RPH/graph.json","fetch_events":"https://pith.science/api/pith-number/QEMTVRFWWIR5AZ2QDV3XPY3RPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH/action/storage_attestation","attest_author":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH/action/author_attestation","sign_citation":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH/action/citation_signature","submit_replication":"https://pith.science/pith/QEMTVRFWWIR5AZ2QDV3XPY3RPH/action/replication_record"}},"created_at":"2026-05-18T00:17:09.201482+00:00","updated_at":"2026-05-18T00:17:09.201482+00:00"}