{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GBN7AEEAKM4W7GFQCAOXRU5HUG","short_pith_number":"pith:GBN7AEEA","canonical_record":{"source":{"id":"1601.02099","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-09T12:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"d0f662be83e1d6853d5b9b9b267b2df54c68ce02ffeec1ef760f674424d66cb5","abstract_canon_sha256":"633f00822a788cf01540c1c38130ac690d36d98b5ac09ab1ae4b345a6141b4a7"},"schema_version":"1.0"},"canonical_sha256":"305bf0108053396f98b0101d78d3a7a19e69a4840cdead6ca86a7cd8079f6e13","source":{"kind":"arxiv","id":"1601.02099","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02099","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02099v2","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02099","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"GBN7AEEAKM4W","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"GBN7AEEAKM4W7GFQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"GBN7AEEA","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GBN7AEEAKM4W7GFQCAOXRU5HUG","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02099","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-09T12:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"d0f662be83e1d6853d5b9b9b267b2df54c68ce02ffeec1ef760f674424d66cb5","abstract_canon_sha256":"633f00822a788cf01540c1c38130ac690d36d98b5ac09ab1ae4b345a6141b4a7"},"schema_version":"1.0"},"canonical_sha256":"305bf0108053396f98b0101d78d3a7a19e69a4840cdead6ca86a7cd8079f6e13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.066296Z","signature_b64":"8BUE3wD1fF/kIogQVChCAgce0ci/nqm6qK5mNlPcZYXMOx5ZqCtnopNSthhTVam6NnLKDr3cyuNH2sCTWwclCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"305bf0108053396f98b0101d78d3a7a19e69a4840cdead6ca86a7cd8079f6e13","last_reissued_at":"2026-05-18T01:20:50.065815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.065815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02099","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-05-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2YdHr7bAkoJrL7lKXmJh3dChxuzEJcjXw5dQW6BC+pFjRKogjrm0Lj0pBVFFhx+x9A3Oz7Cv9ebgQL69olHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:24:05.076777Z"},"content_sha256":"cea1cff8e58cf453e19ae6f0bc079eb10b3d77b0b31685342c8781b2cc54e3d9","schema_version":"1.0","event_id":"sha256:cea1cff8e58cf453e19ae6f0bc079eb10b3d77b0b31685342c8781b2cc54e3d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GBN7AEEAKM4W7GFQCAOXRU5HUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Michael Gentner","submitted_at":"2016-01-09T12:06:15Z","abstract_excerpt":"Let $G$ be a graph, and let $\\rho\\in (0,1)$. For a set $D$ of vertices of $G$, let the set $H_{\\rho}(D)$ arise by starting with the set $D$, and iteratively adding further vertices $u$ to the current set if they have at least $\\lceil \\rho d_G(u)\\rceil$ neighbors in it. If $H_{\\rho}(D)$ contains all vertices of $G$, then $D$ is known as an irreversible dynamic monopoly or a perfect target set associated with the threshold function $u\\mapsto \\lceil \\rho d_G(u)\\rceil$. Let $h_{\\rho}(G)$ be the minimum cardinality of such an irreversible dynamic monopoly.\n  For a connected graph $G$ of maximum deg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02099","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"},"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-05-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQBqdjO8ejRii1M/V/iwdHRMMCRxNkhfKgFe77TNhjGydsc61Zl799Ovr0dxSXA5FcM2xd8ZYEMFdMQYaEEvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:24:05.077432Z"},"content_sha256":"86d27eeba029b2bb1666eb904183e732bc00dd0e90efda0634c030ea268400df","schema_version":"1.0","event_id":"sha256:86d27eeba029b2bb1666eb904183e732bc00dd0e90efda0634c030ea268400df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBN7AEEAKM4W7GFQCAOXRU5HUG/bundle.json","state_url":"https://pith.science/pith/GBN7AEEAKM4W7GFQCAOXRU5HUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBN7AEEAKM4W7GFQCAOXRU5HUG/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-11T07:24:05Z","links":{"resolver":"https://pith.science/pith/GBN7AEEAKM4W7GFQCAOXRU5HUG","bundle":"https://pith.science/pith/GBN7AEEAKM4W7GFQCAOXRU5HUG/bundle.json","state":"https://pith.science/pith/GBN7AEEAKM4W7GFQCAOXRU5HUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBN7AEEAKM4W7GFQCAOXRU5HUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GBN7AEEAKM4W7GFQCAOXRU5HUG","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":"633f00822a788cf01540c1c38130ac690d36d98b5ac09ab1ae4b345a6141b4a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-09T12:06:15Z","title_canon_sha256":"d0f662be83e1d6853d5b9b9b267b2df54c68ce02ffeec1ef760f674424d66cb5"},"schema_version":"1.0","source":{"id":"1601.02099","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02099","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02099v2","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02099","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"GBN7AEEAKM4W","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"GBN7AEEAKM4W7GFQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"GBN7AEEA","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:86d27eeba029b2bb1666eb904183e732bc00dd0e90efda0634c030ea268400df","target":"graph","created_at":"2026-05-18T01:20:50Z","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"},"paper":{"abstract_excerpt":"Let $G$ be a graph, and let $\\rho\\in (0,1)$. For a set $D$ of vertices of $G$, let the set $H_{\\rho}(D)$ arise by starting with the set $D$, and iteratively adding further vertices $u$ to the current set if they have at least $\\lceil \\rho d_G(u)\\rceil$ neighbors in it. If $H_{\\rho}(D)$ contains all vertices of $G$, then $D$ is known as an irreversible dynamic monopoly or a perfect target set associated with the threshold function $u\\mapsto \\lceil \\rho d_G(u)\\rceil$. Let $h_{\\rho}(G)$ be the minimum cardinality of such an irreversible dynamic monopoly.\n  For a connected graph $G$ of maximum deg","authors_text":"Dieter Rautenbach, Michael Gentner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-09T12:06:15Z","title":"Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02099","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:cea1cff8e58cf453e19ae6f0bc079eb10b3d77b0b31685342c8781b2cc54e3d9","target":"record","created_at":"2026-05-18T01:20:50Z","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":"633f00822a788cf01540c1c38130ac690d36d98b5ac09ab1ae4b345a6141b4a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-09T12:06:15Z","title_canon_sha256":"d0f662be83e1d6853d5b9b9b267b2df54c68ce02ffeec1ef760f674424d66cb5"},"schema_version":"1.0","source":{"id":"1601.02099","kind":"arxiv","version":2}},"canonical_sha256":"305bf0108053396f98b0101d78d3a7a19e69a4840cdead6ca86a7cd8079f6e13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"305bf0108053396f98b0101d78d3a7a19e69a4840cdead6ca86a7cd8079f6e13","first_computed_at":"2026-05-18T01:20:50.065815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:50.065815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8BUE3wD1fF/kIogQVChCAgce0ci/nqm6qK5mNlPcZYXMOx5ZqCtnopNSthhTVam6NnLKDr3cyuNH2sCTWwclCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:50.066296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02099","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cea1cff8e58cf453e19ae6f0bc079eb10b3d77b0b31685342c8781b2cc54e3d9","sha256:86d27eeba029b2bb1666eb904183e732bc00dd0e90efda0634c030ea268400df"],"state_sha256":"22510ea81315a8d7541d023182d4d6ab3a14f5c6f0a31ab70db9208966393700"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clSQTazYP6DDSRUSGPkI8i4oDWj/MwJ2kU1C80jSWRDh3zG5IZsnZYp45hiz2aJOHfmhDjpI59wk0J6gkcV7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:24:05.082402Z","bundle_sha256":"3754e1b30e495147462aa3053602831e72afd8d86d4516a26737023883732e03"}}