{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A7MOLIDUAZKX2OHUNL6CM2GEAK","short_pith_number":"pith:A7MOLIDU","schema_version":"1.0","canonical_sha256":"07d8e5a07406557d38f46afc2668c402ae5f5d3031397043a911be1d9e9660ab","source":{"kind":"arxiv","id":"1711.02721","version":2},"attestation_state":"computed","paper":{"title":"Exact analytical solution of irreversible binary dynamics on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Edward Laurence, Jean-Gabriel Young, Louis J. Dub\\'e, Sergey Melnik","submitted_at":"2017-11-07T20:51:53Z","abstract_excerpt":"In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, "},"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":"1711.02721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-11-07T20:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"7803c42264cabb94414246a40e931a4c7dafd5ac553376a956843a8037c204a2","abstract_canon_sha256":"67555f3c072fd61d97c1c74ff278388588b7afbc761373dc6c949dd7d3bcb0f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:56.031749Z","signature_b64":"AqUwDKVZ+Clb6iS3INZZbPH0lhR6FpxWIE2h56Hm9tDP86R51olYBe+sOmMKCA0iIqw/xVO5W8bZ9BzbheqUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d8e5a07406557d38f46afc2668c402ae5f5d3031397043a911be1d9e9660ab","last_reissued_at":"2026-05-18T00:20:56.031227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:56.031227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact analytical solution of irreversible binary dynamics on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Edward Laurence, Jean-Gabriel Young, Louis J. Dub\\'e, Sergey Melnik","submitted_at":"2017-11-07T20:51:53Z","abstract_excerpt":"In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02721","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":""},"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":"1711.02721","created_at":"2026-05-18T00:20:56.031303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02721v2","created_at":"2026-05-18T00:20:56.031303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02721","created_at":"2026-05-18T00:20:56.031303+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7MOLIDUAZKX","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7MOLIDUAZKX2OHU","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7MOLIDU","created_at":"2026-05-18T12:31:05.417338+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/A7MOLIDUAZKX2OHUNL6CM2GEAK","json":"https://pith.science/pith/A7MOLIDUAZKX2OHUNL6CM2GEAK.json","graph_json":"https://pith.science/api/pith-number/A7MOLIDUAZKX2OHUNL6CM2GEAK/graph.json","events_json":"https://pith.science/api/pith-number/A7MOLIDUAZKX2OHUNL6CM2GEAK/events.json","paper":"https://pith.science/paper/A7MOLIDU"},"agent_actions":{"view_html":"https://pith.science/pith/A7MOLIDUAZKX2OHUNL6CM2GEAK","download_json":"https://pith.science/pith/A7MOLIDUAZKX2OHUNL6CM2GEAK.json","view_paper":"https://pith.science/paper/A7MOLIDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02721&json=true","fetch_graph":"https://pith.science/api/pith-number/A7MOLIDUAZKX2OHUNL6CM2GEAK/graph.json","fetch_events":"https://pith.science/api/pith-number/A7MOLIDUAZKX2OHUNL6CM2GEAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7MOLIDUAZKX2OHUNL6CM2GEAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7MOLIDUAZKX2OHUNL6CM2GEAK/action/storage_attestation","attest_author":"https://pith.science/pith/A7MOLIDUAZKX2OHUNL6CM2GEAK/action/author_attestation","sign_citation":"https://pith.science/pith/A7MOLIDUAZKX2OHUNL6CM2GEAK/action/citation_signature","submit_replication":"https://pith.science/pith/A7MOLIDUAZKX2OHUNL6CM2GEAK/action/replication_record"}},"created_at":"2026-05-18T00:20:56.031303+00:00","updated_at":"2026-05-18T00:20:56.031303+00:00"}