{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YAS2YJSZ25B7KXGNKAO33UEVZU","short_pith_number":"pith:YAS2YJSZ","canonical_record":{"source":{"id":"1904.02943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-05T09:06:37Z","cross_cats_sorted":[],"title_canon_sha256":"0315cbec49581ca6f7a57d4edc01c2899023b0c0b88785b03e80d9dcbe0d6bef","abstract_canon_sha256":"5ba0207691c758e36daf16d166b12bec5e131792e4af0b3fca9c5c58eb6dfede"},"schema_version":"1.0"},"canonical_sha256":"c025ac2659d743f55ccd501dbdd095cd33ad79d14e2dce266c39cf139e2f0784","source":{"kind":"arxiv","id":"1904.02943","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02943","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02943v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02943","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"YAS2YJSZ25B7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YAS2YJSZ25B7KXGN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YAS2YJSZ","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YAS2YJSZ25B7KXGNKAO33UEVZU","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-05T09:06:37Z","cross_cats_sorted":[],"title_canon_sha256":"0315cbec49581ca6f7a57d4edc01c2899023b0c0b88785b03e80d9dcbe0d6bef","abstract_canon_sha256":"5ba0207691c758e36daf16d166b12bec5e131792e4af0b3fca9c5c58eb6dfede"},"schema_version":"1.0"},"canonical_sha256":"c025ac2659d743f55ccd501dbdd095cd33ad79d14e2dce266c39cf139e2f0784","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:19.133849Z","signature_b64":"BpfbVOJKX0hK1AyryS8nukxA4p7+ziMU1IMSjSyS9S/yIX+ysNhp/j1U3HWnoyTlI89zm2cnrkLjU2oOxmqTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c025ac2659d743f55ccd501dbdd095cd33ad79d14e2dce266c39cf139e2f0784","last_reissued_at":"2026-05-17T23:49:19.133170Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:19.133170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02943","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-17T23:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UU8v8SXvHq9o/xRSnof0yw8KEbEpbxHu1Zvp5rvl2vJY2w/ggBrK3QzUv4GkU82MquKL8kp/kf9TLrmUhLRgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:44:08.627585Z"},"content_sha256":"43131c1773ae0e6aca713f263db78b609fc2a4582b230e049474dca51cfe94f8","schema_version":"1.0","event_id":"sha256:43131c1773ae0e6aca713f263db78b609fc2a4582b230e049474dca51cfe94f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YAS2YJSZ25B7KXGNKAO33UEVZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding the number of $(\\sigma,\\rho)$-dominating sets in trees, forests and graphs of bounded pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthieu Rosenfeld","submitted_at":"2019-04-05T09:06:37Z","abstract_excerpt":"The notion of $(\\sigma,\\rho)$-dominating set generalizes many notions including dominating set, induced matching, perfect codes or independent sets. Bounds on the maximal number of such (maximal, minimal) sets were established for different $\\sigma$ and $\\rho$ and different classes of graphs. In particular, Rote showed that the number of minimal dominating sets in trees of order $n$ is at most $95^{\\frac{n}{13}}$ and Golovach et Al. computed the asymptotic of the number of $(\\sigma,\\rho)$-dominating sets in paths for all $\\sigma$ and $\\rho$.\n  Here, we propose a method to compute bounds on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02943","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-17T23:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ymJODqOhXAbQJXmm4yIGBKJujFF9uxRJRCIr9jvN5gvr4HKC1bvfHenVmGRtw5/Nu10MyArgHegw1Qd9pG9BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:44:08.628261Z"},"content_sha256":"21ea60e6ef601d28d85ff2246331bc4866eee811eac4ee5f606e45e866849c54","schema_version":"1.0","event_id":"sha256:21ea60e6ef601d28d85ff2246331bc4866eee811eac4ee5f606e45e866849c54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/bundle.json","state_url":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/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-05-27T19:44:08Z","links":{"resolver":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU","bundle":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/bundle.json","state":"https://pith.science/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAS2YJSZ25B7KXGNKAO33UEVZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YAS2YJSZ25B7KXGNKAO33UEVZU","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":"5ba0207691c758e36daf16d166b12bec5e131792e4af0b3fca9c5c58eb6dfede","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-05T09:06:37Z","title_canon_sha256":"0315cbec49581ca6f7a57d4edc01c2899023b0c0b88785b03e80d9dcbe0d6bef"},"schema_version":"1.0","source":{"id":"1904.02943","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02943","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02943v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02943","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"YAS2YJSZ25B7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YAS2YJSZ25B7KXGN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YAS2YJSZ","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:21ea60e6ef601d28d85ff2246331bc4866eee811eac4ee5f606e45e866849c54","target":"graph","created_at":"2026-05-17T23:49:19Z","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":"The notion of $(\\sigma,\\rho)$-dominating set generalizes many notions including dominating set, induced matching, perfect codes or independent sets. Bounds on the maximal number of such (maximal, minimal) sets were established for different $\\sigma$ and $\\rho$ and different classes of graphs. In particular, Rote showed that the number of minimal dominating sets in trees of order $n$ is at most $95^{\\frac{n}{13}}$ and Golovach et Al. computed the asymptotic of the number of $(\\sigma,\\rho)$-dominating sets in paths for all $\\sigma$ and $\\rho$.\n  Here, we propose a method to compute bounds on the","authors_text":"Matthieu Rosenfeld","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-05T09:06:37Z","title":"Bounding the number of $(\\sigma,\\rho)$-dominating sets in trees, forests and graphs of bounded pathwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02943","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:43131c1773ae0e6aca713f263db78b609fc2a4582b230e049474dca51cfe94f8","target":"record","created_at":"2026-05-17T23:49:19Z","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":"5ba0207691c758e36daf16d166b12bec5e131792e4af0b3fca9c5c58eb6dfede","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-05T09:06:37Z","title_canon_sha256":"0315cbec49581ca6f7a57d4edc01c2899023b0c0b88785b03e80d9dcbe0d6bef"},"schema_version":"1.0","source":{"id":"1904.02943","kind":"arxiv","version":1}},"canonical_sha256":"c025ac2659d743f55ccd501dbdd095cd33ad79d14e2dce266c39cf139e2f0784","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c025ac2659d743f55ccd501dbdd095cd33ad79d14e2dce266c39cf139e2f0784","first_computed_at":"2026-05-17T23:49:19.133170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:19.133170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BpfbVOJKX0hK1AyryS8nukxA4p7+ziMU1IMSjSyS9S/yIX+ysNhp/j1U3HWnoyTlI89zm2cnrkLjU2oOxmqTAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:19.133849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02943","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43131c1773ae0e6aca713f263db78b609fc2a4582b230e049474dca51cfe94f8","sha256:21ea60e6ef601d28d85ff2246331bc4866eee811eac4ee5f606e45e866849c54"],"state_sha256":"6e4d4b84403e2ece7458dd87f3f29f15b457f19e9d6526e9db0b7191d8ebd445"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdU6pKfto+dWm21T9T5Gy0dnddlySDOeka70mHclC9JVCpMUyNI8KN4pU6JFZA6gP4LW2IBIzjCUETO0w/lKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:44:08.631649Z","bundle_sha256":"897a6c7aeda1d214ce66c179d1fbef16478e58411b5b64c858171f78a1d7e8dc"}}