{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DQLJZBVA2CFBJEA7RKSHEMAWSU","short_pith_number":"pith:DQLJZBVA","schema_version":"1.0","canonical_sha256":"1c169c86a0d08a14901f8aa47230169539e62dfab1372b8c728ff8908b11cbd3","source":{"kind":"arxiv","id":"1201.0045","version":1},"attestation_state":"computed","paper":{"title":"Approximate entropy of network parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Andrew Teschendorff, James West, Lucas Lacasa, Simone Severini","submitted_at":"2011-12-30T00:53:55Z","abstract_excerpt":"We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural entropy obtained by computing the approximate entropy of the so called slide sequence. This is a surrogate of the degree sequence and it is suggested by the frequency partition of a graph. We examine this quantity for standard scale-free and Erd\\H{o}s-R\\'enyi networks. By using classical results of Pincus, we show that our entropy measure converges with netw"},"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":"1201.0045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-12-30T00:53:55Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"4cd631ac4f37dfbf8336d9b3146ae8ee5db3a52917a3ca9ad20d901d8c9eee99","abstract_canon_sha256":"3cd982e200f35b79a7268b5e3b891809dfb1688e390850e1b18bcae0094d8c67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:53.511366Z","signature_b64":"qTruRGkA8wDU3B/IVziQzC7khQuL9fR5cP3X0Gn9LOfkZbPEaqqtnE/6stNKmx7srWlv/YO9qRhBSYWHwgrZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c169c86a0d08a14901f8aa47230169539e62dfab1372b8c728ff8908b11cbd3","last_reissued_at":"2026-05-18T03:22:53.510900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:53.510900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate entropy of network parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Andrew Teschendorff, James West, Lucas Lacasa, Simone Severini","submitted_at":"2011-12-30T00:53:55Z","abstract_excerpt":"We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural entropy obtained by computing the approximate entropy of the so called slide sequence. This is a surrogate of the degree sequence and it is suggested by the frequency partition of a graph. We examine this quantity for standard scale-free and Erd\\H{o}s-R\\'enyi networks. By using classical results of Pincus, we show that our entropy measure converges with netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0045","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":""},"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":"1201.0045","created_at":"2026-05-18T03:22:53.510962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0045v1","created_at":"2026-05-18T03:22:53.510962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0045","created_at":"2026-05-18T03:22:53.510962+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQLJZBVA2CFB","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQLJZBVA2CFBJEA7","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQLJZBVA","created_at":"2026-05-18T12:26:26.731475+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/DQLJZBVA2CFBJEA7RKSHEMAWSU","json":"https://pith.science/pith/DQLJZBVA2CFBJEA7RKSHEMAWSU.json","graph_json":"https://pith.science/api/pith-number/DQLJZBVA2CFBJEA7RKSHEMAWSU/graph.json","events_json":"https://pith.science/api/pith-number/DQLJZBVA2CFBJEA7RKSHEMAWSU/events.json","paper":"https://pith.science/paper/DQLJZBVA"},"agent_actions":{"view_html":"https://pith.science/pith/DQLJZBVA2CFBJEA7RKSHEMAWSU","download_json":"https://pith.science/pith/DQLJZBVA2CFBJEA7RKSHEMAWSU.json","view_paper":"https://pith.science/paper/DQLJZBVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0045&json=true","fetch_graph":"https://pith.science/api/pith-number/DQLJZBVA2CFBJEA7RKSHEMAWSU/graph.json","fetch_events":"https://pith.science/api/pith-number/DQLJZBVA2CFBJEA7RKSHEMAWSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQLJZBVA2CFBJEA7RKSHEMAWSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQLJZBVA2CFBJEA7RKSHEMAWSU/action/storage_attestation","attest_author":"https://pith.science/pith/DQLJZBVA2CFBJEA7RKSHEMAWSU/action/author_attestation","sign_citation":"https://pith.science/pith/DQLJZBVA2CFBJEA7RKSHEMAWSU/action/citation_signature","submit_replication":"https://pith.science/pith/DQLJZBVA2CFBJEA7RKSHEMAWSU/action/replication_record"}},"created_at":"2026-05-18T03:22:53.510962+00:00","updated_at":"2026-05-18T03:22:53.510962+00:00"}