{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4ZEUV32BAMSN5A5ZP6LGY6K2ER","short_pith_number":"pith:4ZEUV32B","schema_version":"1.0","canonical_sha256":"e6494aef410324de83b97f966c795a24743083cf792b743d25c5cfeb7d91537b","source":{"kind":"arxiv","id":"1904.03962","version":1},"attestation_state":"computed","paper":{"title":"Spanning tree modulus for secure broadcast games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kapila Kottegoda, Nathan Albin, Pietro Poggi-Corradini","submitted_at":"2019-04-08T11:24:28Z","abstract_excerpt":"The theory of $p$-modulus provides a general framework for quantifying the richness of a family of objects on a graph. When applied to the family of spanning trees, $p$-modulus has an interesting probabilistic interpretation. In particular, the $2$-modulus problem in this case has been shown to be equivalent to the problem of finding a probability distribution on spanning trees that utilizes the edges of the graph as evenly as possible. In the present work, we use this fact to produce a game-theoretic interpretation of modulus by employing modulus to solve a secure broadcast game."},"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":"1904.03962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-08T11:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"43c3207b11d673b75d5609e46999553625f428dfd0ed73782f4abe39cfd92368","abstract_canon_sha256":"4cc5ce13fb177c74f9f91eb8ddc4270662b9a63cd08db7cf7e4bcbbdd48e978e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:07.568259Z","signature_b64":"TjQmvA4pLPfvHUMxBABJJ9Xpgc6N9Q/bpWfjeAhtnJR07EAxCpDcjWVBaY4BDg/FE/+0e8O7Az2Ee04JK5l5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6494aef410324de83b97f966c795a24743083cf792b743d25c5cfeb7d91537b","last_reissued_at":"2026-05-17T23:49:07.567618Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:07.567618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning tree modulus for secure broadcast games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kapila Kottegoda, Nathan Albin, Pietro Poggi-Corradini","submitted_at":"2019-04-08T11:24:28Z","abstract_excerpt":"The theory of $p$-modulus provides a general framework for quantifying the richness of a family of objects on a graph. When applied to the family of spanning trees, $p$-modulus has an interesting probabilistic interpretation. In particular, the $2$-modulus problem in this case has been shown to be equivalent to the problem of finding a probability distribution on spanning trees that utilizes the edges of the graph as evenly as possible. In the present work, we use this fact to produce a game-theoretic interpretation of modulus by employing modulus to solve a secure broadcast game."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03962","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.03962","created_at":"2026-05-17T23:49:07.567714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03962v1","created_at":"2026-05-17T23:49:07.567714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03962","created_at":"2026-05-17T23:49:07.567714+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZEUV32BAMSN","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZEUV32BAMSN5A5Z","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZEUV32B","created_at":"2026-05-18T12:33:10.108867+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/4ZEUV32BAMSN5A5ZP6LGY6K2ER","json":"https://pith.science/pith/4ZEUV32BAMSN5A5ZP6LGY6K2ER.json","graph_json":"https://pith.science/api/pith-number/4ZEUV32BAMSN5A5ZP6LGY6K2ER/graph.json","events_json":"https://pith.science/api/pith-number/4ZEUV32BAMSN5A5ZP6LGY6K2ER/events.json","paper":"https://pith.science/paper/4ZEUV32B"},"agent_actions":{"view_html":"https://pith.science/pith/4ZEUV32BAMSN5A5ZP6LGY6K2ER","download_json":"https://pith.science/pith/4ZEUV32BAMSN5A5ZP6LGY6K2ER.json","view_paper":"https://pith.science/paper/4ZEUV32B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03962&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZEUV32BAMSN5A5ZP6LGY6K2ER/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZEUV32BAMSN5A5ZP6LGY6K2ER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZEUV32BAMSN5A5ZP6LGY6K2ER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZEUV32BAMSN5A5ZP6LGY6K2ER/action/storage_attestation","attest_author":"https://pith.science/pith/4ZEUV32BAMSN5A5ZP6LGY6K2ER/action/author_attestation","sign_citation":"https://pith.science/pith/4ZEUV32BAMSN5A5ZP6LGY6K2ER/action/citation_signature","submit_replication":"https://pith.science/pith/4ZEUV32BAMSN5A5ZP6LGY6K2ER/action/replication_record"}},"created_at":"2026-05-17T23:49:07.567714+00:00","updated_at":"2026-05-17T23:49:07.567714+00:00"}