{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OMZ5VUEKGNTGTHCC732VBB6UA6","short_pith_number":"pith:OMZ5VUEK","canonical_record":{"source":{"id":"2208.07484","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T00:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"3c45f38442b42e5114f235fe72cfe07bc935a24f4a3bd76bdfac3149bb2e5ceb","abstract_canon_sha256":"f979338dfba56b084496012d14ba398f9843d8761dd71b74e63890a0091e8385"},"schema_version":"1.0"},"canonical_sha256":"7333dad08a3366699c42fef55087d40790c8c371d5c3d590b1cae7628fdbf773","source":{"kind":"arxiv","id":"2208.07484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07484","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07484v1","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07484","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"OMZ5VUEKGNTG","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"pith_short_16","alias_value":"OMZ5VUEKGNTGTHCC","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"pith_short_8","alias_value":"OMZ5VUEK","created_at":"2026-07-05T04:49:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OMZ5VUEKGNTGTHCC732VBB6UA6","target":"record","payload":{"canonical_record":{"source":{"id":"2208.07484","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T00:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"3c45f38442b42e5114f235fe72cfe07bc935a24f4a3bd76bdfac3149bb2e5ceb","abstract_canon_sha256":"f979338dfba56b084496012d14ba398f9843d8761dd71b74e63890a0091e8385"},"schema_version":"1.0"},"canonical_sha256":"7333dad08a3366699c42fef55087d40790c8c371d5c3d590b1cae7628fdbf773","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:05.280697Z","signature_b64":"Ncpo0DNx1zyL3NM//irPoHWpZHbF56YE5ELh3sGsrBI5+OOiMtaX14bH1kE4AsMkuDM0AISMYFkezLMd5uWGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7333dad08a3366699c42fef55087d40790c8c371d5c3d590b1cae7628fdbf773","last_reissued_at":"2026-07-05T04:49:05.280275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:05.280275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.07484","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-07-05T04:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZ32/iuzGscLClJ4lNPk3gUFaLScCWNKM8DhbV4v5T7PwLMmFpcYsbWVPhplznKJrnB2FGZXcflzi2nQa6TVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:15:55.225596Z"},"content_sha256":"a10cf716e02ca4634cc49f4f3a73e2fff6d6af60c0b8cf487f6186149f9a693e","schema_version":"1.0","event_id":"sha256:a10cf716e02ca4634cc49f4f3a73e2fff6d6af60c0b8cf487f6186149f9a693e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OMZ5VUEKGNTGTHCC732VBB6UA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Bondage Number: The $k$-synchronous bondage number of a graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alvaro Belmonte, Bryan Walker, Elise Sinani, Nathan Shank, Rey Anaya","submitted_at":"2022-08-16T00:52:59Z","abstract_excerpt":"We investigate a generalization of the bondage number of a graph called the \\textit{$k\\,$-synchronous bondage number}. The $k\\,$-synchronous bondage number of a graph is the smallest number of edges that, when removed, increases the dominating number by $k$. In this paper, we discuss the 2-synchronous bondage number and then generalize to $k\\,$-synchronous bondage number. We present $k\\,$-synchronous bondage number for several graph classes and give bounds for general graphs. We propose this characteristic as a metric of the connectivity of a simple graph with possible uses in the field of net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07484","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.07484/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-05T04:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6xKRTHPIwDSL72rBPQNAvhLPY8tidy+qKmitF6czgSTANbBdIgyet1JQfxsnaXq7iCnC6F9UL3Hu+EKyFYwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:15:55.226485Z"},"content_sha256":"70acf8e8b8b210d24df1fd31deb87187d3f44e03ed239f603c5794d7fa189376","schema_version":"1.0","event_id":"sha256:70acf8e8b8b210d24df1fd31deb87187d3f44e03ed239f603c5794d7fa189376"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMZ5VUEKGNTGTHCC732VBB6UA6/bundle.json","state_url":"https://pith.science/pith/OMZ5VUEKGNTGTHCC732VBB6UA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMZ5VUEKGNTGTHCC732VBB6UA6/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-05T03:15:55Z","links":{"resolver":"https://pith.science/pith/OMZ5VUEKGNTGTHCC732VBB6UA6","bundle":"https://pith.science/pith/OMZ5VUEKGNTGTHCC732VBB6UA6/bundle.json","state":"https://pith.science/pith/OMZ5VUEKGNTGTHCC732VBB6UA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMZ5VUEKGNTGTHCC732VBB6UA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OMZ5VUEKGNTGTHCC732VBB6UA6","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":"f979338dfba56b084496012d14ba398f9843d8761dd71b74e63890a0091e8385","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T00:52:59Z","title_canon_sha256":"3c45f38442b42e5114f235fe72cfe07bc935a24f4a3bd76bdfac3149bb2e5ceb"},"schema_version":"1.0","source":{"id":"2208.07484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07484","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07484v1","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07484","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"OMZ5VUEKGNTG","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"pith_short_16","alias_value":"OMZ5VUEKGNTGTHCC","created_at":"2026-07-05T04:49:05Z"},{"alias_kind":"pith_short_8","alias_value":"OMZ5VUEK","created_at":"2026-07-05T04:49:05Z"}],"graph_snapshots":[{"event_id":"sha256:70acf8e8b8b210d24df1fd31deb87187d3f44e03ed239f603c5794d7fa189376","target":"graph","created_at":"2026-07-05T04:49:05Z","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/2208.07484/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate a generalization of the bondage number of a graph called the \\textit{$k\\,$-synchronous bondage number}. The $k\\,$-synchronous bondage number of a graph is the smallest number of edges that, when removed, increases the dominating number by $k$. In this paper, we discuss the 2-synchronous bondage number and then generalize to $k\\,$-synchronous bondage number. We present $k\\,$-synchronous bondage number for several graph classes and give bounds for general graphs. We propose this characteristic as a metric of the connectivity of a simple graph with possible uses in the field of net","authors_text":"Alvaro Belmonte, Bryan Walker, Elise Sinani, Nathan Shank, Rey Anaya","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T00:52:59Z","title":"Generalized Bondage Number: The $k$-synchronous bondage number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07484","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:a10cf716e02ca4634cc49f4f3a73e2fff6d6af60c0b8cf487f6186149f9a693e","target":"record","created_at":"2026-07-05T04:49:05Z","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":"f979338dfba56b084496012d14ba398f9843d8761dd71b74e63890a0091e8385","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T00:52:59Z","title_canon_sha256":"3c45f38442b42e5114f235fe72cfe07bc935a24f4a3bd76bdfac3149bb2e5ceb"},"schema_version":"1.0","source":{"id":"2208.07484","kind":"arxiv","version":1}},"canonical_sha256":"7333dad08a3366699c42fef55087d40790c8c371d5c3d590b1cae7628fdbf773","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7333dad08a3366699c42fef55087d40790c8c371d5c3d590b1cae7628fdbf773","first_computed_at":"2026-07-05T04:49:05.280275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:49:05.280275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ncpo0DNx1zyL3NM//irPoHWpZHbF56YE5ELh3sGsrBI5+OOiMtaX14bH1kE4AsMkuDM0AISMYFkezLMd5uWGCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:49:05.280697Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.07484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a10cf716e02ca4634cc49f4f3a73e2fff6d6af60c0b8cf487f6186149f9a693e","sha256:70acf8e8b8b210d24df1fd31deb87187d3f44e03ed239f603c5794d7fa189376"],"state_sha256":"70d486164b482a4dc32a021241d51c7b0b349bd45b04e996698762d0a4fd639e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2voCjbQkKRdaXlRrOZ3yA+GNdVmWK416XVFSRNxpVBvK1HFCFFKaZp7JQ44TGg4H87uRCkx0wt0W3aYaumrdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:15:55.231934Z","bundle_sha256":"85a5380f4c5c62eb86c1f5ba4c215507c383a5619e78231eebe4a0c074f139f7"}}