{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:D6UPXSYAVKFWTVEXTBMDK5G5RM","short_pith_number":"pith:D6UPXSYA","schema_version":"1.0","canonical_sha256":"1fa8fbcb00aa8b69d49798583574dd8b0aca7e884003cb41e67f4df5e673d8ee","source":{"kind":"arxiv","id":"2012.12696","version":3},"attestation_state":"computed","paper":{"title":"NetworkDynamics.jl -- Composing and simulating complex networks in Julia","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.MS","authors_text":"Anton Plietzsch, Fenja Drauschke, Frank Hellmann, Hans W\\\"urfel, Julia Monika Koulen, Lucas Lincoln, Michael Lindner","submitted_at":"2020-12-22T11:41:24Z","abstract_excerpt":"NetworkDynamics.jl is an easy-to-use and computationally efficient package for working with heterogeneous dynamical systems on complex networks, written in Julia, a high-level, high-performance, dynamic programming language. By combining state of the art solver algorithms from DifferentialEquations.jl with efficient data structures, NetworkDynamics.jl achieves top performance while supporting advanced features like events, algebraic constraints, time-delays, noise terms and automatic differentiation."},"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":"2012.12696","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2020-12-22T11:41:24Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"595d8b6017cc5011df30083c44ec7f00338824f9110f12be9e9b36939e9fa3af","abstract_canon_sha256":"ec38dbb49b363311f9db979947211349a50b2c014e28633274f59a6d8e7ae5d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:15.843909Z","signature_b64":"8jVpuBxp/2lIeIoa8JTBTbpsHrr9O7w9IoeML4SP1Gt8sq5flseNMPtQNoWCTN6u83l4SwCukrDelvdWakeNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fa8fbcb00aa8b69d49798583574dd8b0aca7e884003cb41e67f4df5e673d8ee","last_reissued_at":"2026-07-05T02:54:15.843439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:15.843439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NetworkDynamics.jl -- Composing and simulating complex networks in Julia","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.MS","authors_text":"Anton Plietzsch, Fenja Drauschke, Frank Hellmann, Hans W\\\"urfel, Julia Monika Koulen, Lucas Lincoln, Michael Lindner","submitted_at":"2020-12-22T11:41:24Z","abstract_excerpt":"NetworkDynamics.jl is an easy-to-use and computationally efficient package for working with heterogeneous dynamical systems on complex networks, written in Julia, a high-level, high-performance, dynamic programming language. By combining state of the art solver algorithms from DifferentialEquations.jl with efficient data structures, NetworkDynamics.jl achieves top performance while supporting advanced features like events, algebraic constraints, time-delays, noise terms and automatic differentiation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.12696","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.12696/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":"2012.12696","created_at":"2026-07-05T02:54:15.843496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.12696v3","created_at":"2026-07-05T02:54:15.843496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.12696","created_at":"2026-07-05T02:54:15.843496+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6UPXSYAVKFW","created_at":"2026-07-05T02:54:15.843496+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6UPXSYAVKFWTVEX","created_at":"2026-07-05T02:54:15.843496+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6UPXSYA","created_at":"2026-07-05T02:54:15.843496+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/D6UPXSYAVKFWTVEXTBMDK5G5RM","json":"https://pith.science/pith/D6UPXSYAVKFWTVEXTBMDK5G5RM.json","graph_json":"https://pith.science/api/pith-number/D6UPXSYAVKFWTVEXTBMDK5G5RM/graph.json","events_json":"https://pith.science/api/pith-number/D6UPXSYAVKFWTVEXTBMDK5G5RM/events.json","paper":"https://pith.science/paper/D6UPXSYA"},"agent_actions":{"view_html":"https://pith.science/pith/D6UPXSYAVKFWTVEXTBMDK5G5RM","download_json":"https://pith.science/pith/D6UPXSYAVKFWTVEXTBMDK5G5RM.json","view_paper":"https://pith.science/paper/D6UPXSYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.12696&json=true","fetch_graph":"https://pith.science/api/pith-number/D6UPXSYAVKFWTVEXTBMDK5G5RM/graph.json","fetch_events":"https://pith.science/api/pith-number/D6UPXSYAVKFWTVEXTBMDK5G5RM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6UPXSYAVKFWTVEXTBMDK5G5RM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6UPXSYAVKFWTVEXTBMDK5G5RM/action/storage_attestation","attest_author":"https://pith.science/pith/D6UPXSYAVKFWTVEXTBMDK5G5RM/action/author_attestation","sign_citation":"https://pith.science/pith/D6UPXSYAVKFWTVEXTBMDK5G5RM/action/citation_signature","submit_replication":"https://pith.science/pith/D6UPXSYAVKFWTVEXTBMDK5G5RM/action/replication_record"}},"created_at":"2026-07-05T02:54:15.843496+00:00","updated_at":"2026-07-05T02:54:15.843496+00:00"}