{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:V3T4L2FHTZX7STZGTB72SAJAAF","short_pith_number":"pith:V3T4L2FH","canonical_record":{"source":{"id":"2504.06967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-09T15:23:10Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6cfeaed4d4c8ecedbe2d4a883dcdf34bb6943a27d72dd6d03fa71e3e323d7de9","abstract_canon_sha256":"66e1173af7cee414fa2a94acbae7db7756fb78a52f7d61cf89d9db5d5d3910b5"},"schema_version":"1.0"},"canonical_sha256":"aee7c5e8a79e6ff94f26987fa90120014d7dae00a6cb329702d10d13de034011","source":{"kind":"arxiv","id":"2504.06967","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.06967","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"arxiv_version","alias_value":"2504.06967v2","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06967","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"pith_short_12","alias_value":"V3T4L2FHTZX7","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"pith_short_16","alias_value":"V3T4L2FHTZX7STZG","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"pith_short_8","alias_value":"V3T4L2FH","created_at":"2026-06-11T01:10:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:V3T4L2FHTZX7STZGTB72SAJAAF","target":"record","payload":{"canonical_record":{"source":{"id":"2504.06967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-09T15:23:10Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6cfeaed4d4c8ecedbe2d4a883dcdf34bb6943a27d72dd6d03fa71e3e323d7de9","abstract_canon_sha256":"66e1173af7cee414fa2a94acbae7db7756fb78a52f7d61cf89d9db5d5d3910b5"},"schema_version":"1.0"},"canonical_sha256":"aee7c5e8a79e6ff94f26987fa90120014d7dae00a6cb329702d10d13de034011","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:26.078328Z","signature_b64":"F+Jn5YHyIx0R+GJN89OtNiICd9TdxUM6eceNSmJzHaVBD0SLAcucTXbs9yNBNRUj4UOYj+DAKRJtTEELdDnxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aee7c5e8a79e6ff94f26987fa90120014d7dae00a6cb329702d10d13de034011","last_reissued_at":"2026-06-11T01:10:26.077403Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:26.077403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.06967","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8+eExd+GewOLqtsZRdmXRozn42Lj9g3c/U/zq1+S9ZdFt2jZHt2la7JggQ4Y9ADr09olVeLVvp0eo9Af/YGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:39:14.960393Z"},"content_sha256":"1188509cc866fa59ebef37c6fe088bd704682a7b65749a77fc724f22e56a80ab","schema_version":"1.0","event_id":"sha256:1188509cc866fa59ebef37c6fe088bd704682a7b65749a77fc724f22e56a80ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:V3T4L2FHTZX7STZGTB72SAJAAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal promotions of new products on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.OC","authors_text":"Amit Golan, Gadi Fibich","submitted_at":"2025-04-09T15:23:10Z","abstract_excerpt":"We present a novel methodology for analyzing the optimal promotion in the Bass model for the spreading of new products on networks. For general networks with $M$ nodes, the optimal promotion is the solution of $2^M-1$ nonlinearly-coupled boundary-value problems. On structured networks, however, the number of equations can be reduced to a manageable size which is amendable to simulations and analysis. This enables us to gain insight into the effect of the network structure on optimal promotions. We find that the optimal advertising strategy decreases with time, whereas the optimal boosting of p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06967","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/2504.06967/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAN0bHii6wWd4mPSRHi5S9QMpQrUk1mKnk2gLgKxynh28UXfjGnXxUq215oJc7rWtEqpAniytM8jQ2RyL5iRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:39:14.960773Z"},"content_sha256":"097e6ad43c6af44de45fb7e802bfa52486c205c671679c194b2f331f35840e9d","schema_version":"1.0","event_id":"sha256:097e6ad43c6af44de45fb7e802bfa52486c205c671679c194b2f331f35840e9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3T4L2FHTZX7STZGTB72SAJAAF/bundle.json","state_url":"https://pith.science/pith/V3T4L2FHTZX7STZGTB72SAJAAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3T4L2FHTZX7STZGTB72SAJAAF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T06:39:14Z","links":{"resolver":"https://pith.science/pith/V3T4L2FHTZX7STZGTB72SAJAAF","bundle":"https://pith.science/pith/V3T4L2FHTZX7STZGTB72SAJAAF/bundle.json","state":"https://pith.science/pith/V3T4L2FHTZX7STZGTB72SAJAAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3T4L2FHTZX7STZGTB72SAJAAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V3T4L2FHTZX7STZGTB72SAJAAF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"66e1173af7cee414fa2a94acbae7db7756fb78a52f7d61cf89d9db5d5d3910b5","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-09T15:23:10Z","title_canon_sha256":"6cfeaed4d4c8ecedbe2d4a883dcdf34bb6943a27d72dd6d03fa71e3e323d7de9"},"schema_version":"1.0","source":{"id":"2504.06967","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.06967","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"arxiv_version","alias_value":"2504.06967v2","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06967","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"pith_short_12","alias_value":"V3T4L2FHTZX7","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"pith_short_16","alias_value":"V3T4L2FHTZX7STZG","created_at":"2026-06-11T01:10:26Z"},{"alias_kind":"pith_short_8","alias_value":"V3T4L2FH","created_at":"2026-06-11T01:10:26Z"}],"graph_snapshots":[{"event_id":"sha256:097e6ad43c6af44de45fb7e802bfa52486c205c671679c194b2f331f35840e9d","target":"graph","created_at":"2026-06-11T01:10:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.06967/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a novel methodology for analyzing the optimal promotion in the Bass model for the spreading of new products on networks. For general networks with $M$ nodes, the optimal promotion is the solution of $2^M-1$ nonlinearly-coupled boundary-value problems. On structured networks, however, the number of equations can be reduced to a manageable size which is amendable to simulations and analysis. This enables us to gain insight into the effect of the network structure on optimal promotions. We find that the optimal advertising strategy decreases with time, whereas the optimal boosting of p","authors_text":"Amit Golan, Gadi Fibich","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-09T15:23:10Z","title":"Optimal promotions of new products on networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06967","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1188509cc866fa59ebef37c6fe088bd704682a7b65749a77fc724f22e56a80ab","target":"record","created_at":"2026-06-11T01:10:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"66e1173af7cee414fa2a94acbae7db7756fb78a52f7d61cf89d9db5d5d3910b5","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-09T15:23:10Z","title_canon_sha256":"6cfeaed4d4c8ecedbe2d4a883dcdf34bb6943a27d72dd6d03fa71e3e323d7de9"},"schema_version":"1.0","source":{"id":"2504.06967","kind":"arxiv","version":2}},"canonical_sha256":"aee7c5e8a79e6ff94f26987fa90120014d7dae00a6cb329702d10d13de034011","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aee7c5e8a79e6ff94f26987fa90120014d7dae00a6cb329702d10d13de034011","first_computed_at":"2026-06-11T01:10:26.077403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:26.077403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F+Jn5YHyIx0R+GJN89OtNiICd9TdxUM6eceNSmJzHaVBD0SLAcucTXbs9yNBNRUj4UOYj+DAKRJtTEELdDnxCw==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:26.078328Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.06967","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1188509cc866fa59ebef37c6fe088bd704682a7b65749a77fc724f22e56a80ab","sha256:097e6ad43c6af44de45fb7e802bfa52486c205c671679c194b2f331f35840e9d"],"state_sha256":"013d2e10a57c9768354f98d7491f57ca6d8c5593c6d452bdeb03ca9f5671300e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7v75QT8ZYs4TuCiy7Jc5NBDydPSOk5rAoTB5VDYt8rDgZ8nzNaqwcZlNkL5UdCeZ+GboyOwKZ4wuQhuDOAdfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T06:39:14.962793Z","bundle_sha256":"f74643285f971b43e5bdb38b65a820dd89df4b3375295eb7a6b156d06b6a10e4"}}