{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:STHQJ63BKFDSQZ3NA3H5XIJRX5","short_pith_number":"pith:STHQJ63B","canonical_record":{"source":{"id":"2505.14281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T12:32:08Z","cross_cats_sorted":[],"title_canon_sha256":"edcac6abf9c89812520f6e6a4d3385b34996c4b6ef588ee17e334ba0f609d531","abstract_canon_sha256":"d3f48686d212be410d671aa31d9ee27e95e6fa5a03afc36534edff894fd83802"},"schema_version":"1.0"},"canonical_sha256":"94cf04fb61514728676d06cfdba131bf79ddaa7a66b4771fb1e17db33c8122a8","source":{"kind":"arxiv","id":"2505.14281","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14281","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14281v2","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14281","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"pith_short_12","alias_value":"STHQJ63BKFDS","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"pith_short_16","alias_value":"STHQJ63BKFDSQZ3N","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"pith_short_8","alias_value":"STHQJ63B","created_at":"2026-07-05T11:31:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:STHQJ63BKFDSQZ3NA3H5XIJRX5","target":"record","payload":{"canonical_record":{"source":{"id":"2505.14281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T12:32:08Z","cross_cats_sorted":[],"title_canon_sha256":"edcac6abf9c89812520f6e6a4d3385b34996c4b6ef588ee17e334ba0f609d531","abstract_canon_sha256":"d3f48686d212be410d671aa31d9ee27e95e6fa5a03afc36534edff894fd83802"},"schema_version":"1.0"},"canonical_sha256":"94cf04fb61514728676d06cfdba131bf79ddaa7a66b4771fb1e17db33c8122a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:06.955265Z","signature_b64":"s6nZnC6DyqeRX9ma2DHdMMngOvssPUgIolf/E9jkH2ffpq0EuTszryl0RCRP3r29o5Ll/tD3295JF3+dSqe+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94cf04fb61514728676d06cfdba131bf79ddaa7a66b4771fb1e17db33c8122a8","last_reissued_at":"2026-07-05T11:31:06.954734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:06.954734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.14281","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-07-05T11:31:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFfYqKzZW8nimhX7qi0H0ApaNt/p1qlp0ku98b1gEqDkmzTrWoe0KdI7qxGzVWnP7FFRV8/g57eIJSt+cXhTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:18:13.910761Z"},"content_sha256":"5276121772624ad72fd2541934e202394422210c2daba77685811175832518ce","schema_version":"1.0","event_id":"sha256:5276121772624ad72fd2541934e202394422210c2daba77685811175832518ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:STHQJ63BKFDSQZ3NA3H5XIJRX5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On problems in extremal multigraph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Rik Sarkar, Victor Falgas-Ravry, Victor Souza","submitted_at":"2025-05-20T12:32:08Z","abstract_excerpt":"A multigraph G is said to be an (s,q)-graph if every s-set of vertices in G supports at most q edges (counting multiplicities). In this paper we consider the maximal sum and product of edge multiplicities in an (s,q)-graph on n vertices. These are multigraph analogues of a problem of Erd\\H{o}s raised by F\\\"uredi and K\\\"undgen and Mubayi and Terry respectively, with applications to counting problems and extremal hypergraph theory.\n  We make major progress, settling conjectures of Day, Falgas-Ravry and Treglown and of Falgas-Ravry, establishing intricate behaviour for both the sum and the produc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14281","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/2505.14281/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-07-05T11:31:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJm6u5ZSwUOtm6Kk+9cZ4WqPQcfYA5iLfRlZ7EHJatCmBJ1AZGPVR5AT9prPbm0Zb28zZMQg3bqVXtIkVTMZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:18:13.911411Z"},"content_sha256":"639f8dd3969e1c8b4ed8b0ec1dce1f8fa9b05e19dca4fa2aadda5a16a753c727","schema_version":"1.0","event_id":"sha256:639f8dd3969e1c8b4ed8b0ec1dce1f8fa9b05e19dca4fa2aadda5a16a753c727"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STHQJ63BKFDSQZ3NA3H5XIJRX5/bundle.json","state_url":"https://pith.science/pith/STHQJ63BKFDSQZ3NA3H5XIJRX5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STHQJ63BKFDSQZ3NA3H5XIJRX5/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-08-10T17:18:13Z","links":{"resolver":"https://pith.science/pith/STHQJ63BKFDSQZ3NA3H5XIJRX5","bundle":"https://pith.science/pith/STHQJ63BKFDSQZ3NA3H5XIJRX5/bundle.json","state":"https://pith.science/pith/STHQJ63BKFDSQZ3NA3H5XIJRX5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STHQJ63BKFDSQZ3NA3H5XIJRX5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:STHQJ63BKFDSQZ3NA3H5XIJRX5","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":"d3f48686d212be410d671aa31d9ee27e95e6fa5a03afc36534edff894fd83802","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T12:32:08Z","title_canon_sha256":"edcac6abf9c89812520f6e6a4d3385b34996c4b6ef588ee17e334ba0f609d531"},"schema_version":"1.0","source":{"id":"2505.14281","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14281","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14281v2","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14281","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"pith_short_12","alias_value":"STHQJ63BKFDS","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"pith_short_16","alias_value":"STHQJ63BKFDSQZ3N","created_at":"2026-07-05T11:31:06Z"},{"alias_kind":"pith_short_8","alias_value":"STHQJ63B","created_at":"2026-07-05T11:31:06Z"}],"graph_snapshots":[{"event_id":"sha256:639f8dd3969e1c8b4ed8b0ec1dce1f8fa9b05e19dca4fa2aadda5a16a753c727","target":"graph","created_at":"2026-07-05T11:31:06Z","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/2505.14281/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A multigraph G is said to be an (s,q)-graph if every s-set of vertices in G supports at most q edges (counting multiplicities). In this paper we consider the maximal sum and product of edge multiplicities in an (s,q)-graph on n vertices. These are multigraph analogues of a problem of Erd\\H{o}s raised by F\\\"uredi and K\\\"undgen and Mubayi and Terry respectively, with applications to counting problems and extremal hypergraph theory.\n  We make major progress, settling conjectures of Day, Falgas-Ravry and Treglown and of Falgas-Ravry, establishing intricate behaviour for both the sum and the produc","authors_text":"Adva Mond, Rik Sarkar, Victor Falgas-Ravry, Victor Souza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T12:32:08Z","title":"On problems in extremal multigraph theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14281","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:5276121772624ad72fd2541934e202394422210c2daba77685811175832518ce","target":"record","created_at":"2026-07-05T11:31:06Z","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":"d3f48686d212be410d671aa31d9ee27e95e6fa5a03afc36534edff894fd83802","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T12:32:08Z","title_canon_sha256":"edcac6abf9c89812520f6e6a4d3385b34996c4b6ef588ee17e334ba0f609d531"},"schema_version":"1.0","source":{"id":"2505.14281","kind":"arxiv","version":2}},"canonical_sha256":"94cf04fb61514728676d06cfdba131bf79ddaa7a66b4771fb1e17db33c8122a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94cf04fb61514728676d06cfdba131bf79ddaa7a66b4771fb1e17db33c8122a8","first_computed_at":"2026-07-05T11:31:06.954734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:31:06.954734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s6nZnC6DyqeRX9ma2DHdMMngOvssPUgIolf/E9jkH2ffpq0EuTszryl0RCRP3r29o5Ll/tD3295JF3+dSqe+DA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:31:06.955265Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.14281","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5276121772624ad72fd2541934e202394422210c2daba77685811175832518ce","sha256:639f8dd3969e1c8b4ed8b0ec1dce1f8fa9b05e19dca4fa2aadda5a16a753c727"],"state_sha256":"08c8163bb65fe7bff8087c3d7235008af4f7215f8e3b57b838d2f6b8329e6130"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsiN+abqrNYjgjDmco6NAd86wxfR+oeGR47ZoYoAZhw6/BtEAfph1WsphaMDT/5N4purPHBmRKIrUGvCJPBWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T17:18:13.917776Z","bundle_sha256":"7e2a7ffda0853d30af7c63e470d746200128c9c47f44fd52c4edc39a70e271fb"}}