{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JJ2ESPW5D2U2CRFCFV6ZX343MI","short_pith_number":"pith:JJ2ESPW5","canonical_record":{"source":{"id":"1803.01933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T21:24:16Z","cross_cats_sorted":[],"title_canon_sha256":"3ef1f99728a8fef76c4779f779da0c5c48992e83c815ba9e5954af414c9e1520","abstract_canon_sha256":"74614ec207dc7a86bbf2f7fd5145e33dfa71e280385686d97a48daeffd8e240b"},"schema_version":"1.0"},"canonical_sha256":"4a74493edd1ea9a144a22d7d9bef9b621e12152f018cbcfd20e3643dfa6f4a66","source":{"kind":"arxiv","id":"1803.01933","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01933","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01933v1","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01933","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"JJ2ESPW5D2U2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJ2ESPW5D2U2CRFC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJ2ESPW5","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JJ2ESPW5D2U2CRFCFV6ZX343MI","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T21:24:16Z","cross_cats_sorted":[],"title_canon_sha256":"3ef1f99728a8fef76c4779f779da0c5c48992e83c815ba9e5954af414c9e1520","abstract_canon_sha256":"74614ec207dc7a86bbf2f7fd5145e33dfa71e280385686d97a48daeffd8e240b"},"schema_version":"1.0"},"canonical_sha256":"4a74493edd1ea9a144a22d7d9bef9b621e12152f018cbcfd20e3643dfa6f4a66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:56.281682Z","signature_b64":"uwnTcVIsOop4UPQdlXXAGaXIv6P8buk/NujzgGWKmL2soJ4B5fh99gXXFMJW9HVOy71QbFzhE0eLy68psPynCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a74493edd1ea9a144a22d7d9bef9b621e12152f018cbcfd20e3643dfa6f4a66","last_reissued_at":"2026-05-18T00:21:56.281181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:56.281181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01933","source_version":1,"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-18T00:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVTuBbHNxAjRURIN0m8EfA1f3/hsXRkrAQOdTtc+DKh3xKL/FgdUBI8c9QBTOa94QqGmjFU0NI/NsRN0KIYYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:56:45.504016Z"},"content_sha256":"be0068b171566a01abfa3b3c719e1891dd4116bbaf5b43ffa79cfd211cef69ce","schema_version":"1.0","event_id":"sha256:be0068b171566a01abfa3b3c719e1891dd4116bbaf5b43ffa79cfd211cef69ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JJ2ESPW5D2U2CRFCFV6ZX343MI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for the Exponential Domination Number of $C_m \\times C_n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chassidy Bozeman, Derek Young, Joshua Carlson, Michael Dairyko, Michael Young","submitted_at":"2018-03-05T21:24:16Z","abstract_excerpt":"A vertex $v$ in a porous exponential dominating set assigns weight $\\left(\\tfrac{1}{2}\\right)^{dist(v,u)}$ to vertex $u$. A porous exponential dominating set of a graph $G$ is a subset of $V(G)$ such that every vertex in $V(G)$ has been assigned a sum weight of at least 1. In this paper the porous exponential dominating number, denoted by $\\gamma_e^*(G)$, for the graph $G = C_m \\times C_n$ is discussed. Anderson et. al. proved that $\\frac{mn}{15.875}\\le \\gamma_e^*(C_m \\times C_n) \\le \\frac{mn}{13}$ and conjectured that $\\frac{mn}{13}$ is also the asymptotic lower bound. We use a linear program"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01933","kind":"arxiv","version":1},"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-18T00:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilXc4bOjxp13Fb98LHWEHyI+x3qxcE2lfMaHJuFrmRRITaqddOxzqSHq6RLW1xBX+pSO07kqpToccHAYyDl0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:56:45.504361Z"},"content_sha256":"70779c992286191b9844eaa6eabd0febcaf09a595ee198b6c75daca7a063df72","schema_version":"1.0","event_id":"sha256:70779c992286191b9844eaa6eabd0febcaf09a595ee198b6c75daca7a063df72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ2ESPW5D2U2CRFCFV6ZX343MI/bundle.json","state_url":"https://pith.science/pith/JJ2ESPW5D2U2CRFCFV6ZX343MI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ2ESPW5D2U2CRFCFV6ZX343MI/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-27T12:56:45Z","links":{"resolver":"https://pith.science/pith/JJ2ESPW5D2U2CRFCFV6ZX343MI","bundle":"https://pith.science/pith/JJ2ESPW5D2U2CRFCFV6ZX343MI/bundle.json","state":"https://pith.science/pith/JJ2ESPW5D2U2CRFCFV6ZX343MI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ2ESPW5D2U2CRFCFV6ZX343MI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JJ2ESPW5D2U2CRFCFV6ZX343MI","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":"74614ec207dc7a86bbf2f7fd5145e33dfa71e280385686d97a48daeffd8e240b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T21:24:16Z","title_canon_sha256":"3ef1f99728a8fef76c4779f779da0c5c48992e83c815ba9e5954af414c9e1520"},"schema_version":"1.0","source":{"id":"1803.01933","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01933","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01933v1","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01933","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"JJ2ESPW5D2U2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJ2ESPW5D2U2CRFC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJ2ESPW5","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:70779c992286191b9844eaa6eabd0febcaf09a595ee198b6c75daca7a063df72","target":"graph","created_at":"2026-05-18T00:21:56Z","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":"A vertex $v$ in a porous exponential dominating set assigns weight $\\left(\\tfrac{1}{2}\\right)^{dist(v,u)}$ to vertex $u$. A porous exponential dominating set of a graph $G$ is a subset of $V(G)$ such that every vertex in $V(G)$ has been assigned a sum weight of at least 1. In this paper the porous exponential dominating number, denoted by $\\gamma_e^*(G)$, for the graph $G = C_m \\times C_n$ is discussed. Anderson et. al. proved that $\\frac{mn}{15.875}\\le \\gamma_e^*(C_m \\times C_n) \\le \\frac{mn}{13}$ and conjectured that $\\frac{mn}{13}$ is also the asymptotic lower bound. We use a linear program","authors_text":"Chassidy Bozeman, Derek Young, Joshua Carlson, Michael Dairyko, Michael Young","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T21:24:16Z","title":"Lower Bounds for the Exponential Domination Number of $C_m \\times C_n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01933","kind":"arxiv","version":1},"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:be0068b171566a01abfa3b3c719e1891dd4116bbaf5b43ffa79cfd211cef69ce","target":"record","created_at":"2026-05-18T00:21:56Z","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":"74614ec207dc7a86bbf2f7fd5145e33dfa71e280385686d97a48daeffd8e240b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T21:24:16Z","title_canon_sha256":"3ef1f99728a8fef76c4779f779da0c5c48992e83c815ba9e5954af414c9e1520"},"schema_version":"1.0","source":{"id":"1803.01933","kind":"arxiv","version":1}},"canonical_sha256":"4a74493edd1ea9a144a22d7d9bef9b621e12152f018cbcfd20e3643dfa6f4a66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a74493edd1ea9a144a22d7d9bef9b621e12152f018cbcfd20e3643dfa6f4a66","first_computed_at":"2026-05-18T00:21:56.281181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:56.281181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uwnTcVIsOop4UPQdlXXAGaXIv6P8buk/NujzgGWKmL2soJ4B5fh99gXXFMJW9HVOy71QbFzhE0eLy68psPynCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:56.281682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01933","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be0068b171566a01abfa3b3c719e1891dd4116bbaf5b43ffa79cfd211cef69ce","sha256:70779c992286191b9844eaa6eabd0febcaf09a595ee198b6c75daca7a063df72"],"state_sha256":"976e9f54021af0b58fd6cf549d0bb7b4646a65fb537ef7c7116f5e8efd1db8f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xs4QCcQeCrTVYCJ84oKgFgZygchYmOJqf39bs5Srz5JvjDa1OKWcknxzcM/QlRCso1AfGJp0fWoR0RsEVuB5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:56:45.506278Z","bundle_sha256":"80e8c4acfeb0736cd47f2b28e066958f762b9b741594da715f1a9e73f7801f02"}}