{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DAD4WC54F5QEMIRD4C7EXW3XS7","short_pith_number":"pith:DAD4WC54","schema_version":"1.0","canonical_sha256":"1807cb0bbc2f60462223e0be4bdb7797dd9bc4ccc9c86894de22d347604299a9","source":{"kind":"arxiv","id":"1908.02583","version":2},"attestation_state":"computed","paper":{"title":"Simplicial degree in complex networks. Applications of Topological Data Analysis to Network Science","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Daniel Hern\\'andez Serrano, Dar\\'io S\\'anchez G\\'omez, Juan Hern\\'andez Serrano","submitted_at":"2019-08-02T06:45:45Z","abstract_excerpt":"Network Science provides a universal formalism for modelling and studying complex systems based on pairwise interactions between agents. However, many real networks in the social, biological or computer sciences involve interactions among more than two agents, having thus an inherent structure of a simplicial complex. We propose new notions of higher-order degrees of adjacency for simplices in a simplicial complex, allowing any dimensional comparison among them and their faces, which as far as we know were lacked in the literature. We introduce multi-parameter boundary and coboundary operators"},"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":"1908.02583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-02T06:45:45Z","cross_cats_sorted":["math.AT","physics.soc-ph"],"title_canon_sha256":"3442157bcc74952eb7114b4754b017575ab967f9c1b142a70294362b9e621718","abstract_canon_sha256":"50dfb0193342eefe78cdda4f20ce9ec7977531aa02ec983928cb9e7d45eb89de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:12:21.879845Z","signature_b64":"axkSGuTfON441i1fwkLYGhhyT3rWmeXYfYkzIrp24p+3QB4rdixHcaDBmC/clD5MVXg2+B2s64TGi31Ebwa1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1807cb0bbc2f60462223e0be4bdb7797dd9bc4ccc9c86894de22d347604299a9","last_reissued_at":"2026-07-05T01:12:21.879487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:12:21.879487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplicial degree in complex networks. Applications of Topological Data Analysis to Network Science","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Daniel Hern\\'andez Serrano, Dar\\'io S\\'anchez G\\'omez, Juan Hern\\'andez Serrano","submitted_at":"2019-08-02T06:45:45Z","abstract_excerpt":"Network Science provides a universal formalism for modelling and studying complex systems based on pairwise interactions between agents. However, many real networks in the social, biological or computer sciences involve interactions among more than two agents, having thus an inherent structure of a simplicial complex. We propose new notions of higher-order degrees of adjacency for simplices in a simplicial complex, allowing any dimensional comparison among them and their faces, which as far as we know were lacked in the literature. We introduce multi-parameter boundary and coboundary operators"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02583","kind":"arxiv","version":2},"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/1908.02583/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":"1908.02583","created_at":"2026-07-05T01:12:21.879541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02583v2","created_at":"2026-07-05T01:12:21.879541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02583","created_at":"2026-07-05T01:12:21.879541+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAD4WC54F5QE","created_at":"2026-07-05T01:12:21.879541+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAD4WC54F5QEMIRD","created_at":"2026-07-05T01:12:21.879541+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAD4WC54","created_at":"2026-07-05T01:12:21.879541+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02967","citing_title":"Centrality measures in simplicial complexes: applications of Topological Data Analysis to Network Science","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7","json":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7.json","graph_json":"https://pith.science/api/pith-number/DAD4WC54F5QEMIRD4C7EXW3XS7/graph.json","events_json":"https://pith.science/api/pith-number/DAD4WC54F5QEMIRD4C7EXW3XS7/events.json","paper":"https://pith.science/paper/DAD4WC54"},"agent_actions":{"view_html":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7","download_json":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7.json","view_paper":"https://pith.science/paper/DAD4WC54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02583&json=true","fetch_graph":"https://pith.science/api/pith-number/DAD4WC54F5QEMIRD4C7EXW3XS7/graph.json","fetch_events":"https://pith.science/api/pith-number/DAD4WC54F5QEMIRD4C7EXW3XS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7/action/storage_attestation","attest_author":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7/action/author_attestation","sign_citation":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7/action/citation_signature","submit_replication":"https://pith.science/pith/DAD4WC54F5QEMIRD4C7EXW3XS7/action/replication_record"}},"created_at":"2026-07-05T01:12:21.879541+00:00","updated_at":"2026-07-05T01:12:21.879541+00:00"}