{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M3LPQZLQHJXXANLJVT6SX2TGVR","short_pith_number":"pith:M3LPQZLQ","canonical_record":{"source":{"id":"1701.03040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T16:17:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"779aeaa0ae106942547bad5a5b1e52663b650fd1064b3dc3fb03462f52fa9a5a","abstract_canon_sha256":"4f8bf9aaba17d0a95c27d530546ee274ea56795640621427eef459c95356a55c"},"schema_version":"1.0"},"canonical_sha256":"66d6f865703a6f703569acfd2bea66ac6ee50c99d4704fc3bc4ce5e0cbaffd6e","source":{"kind":"arxiv","id":"1701.03040","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03040","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03040v2","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03040","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"M3LPQZLQHJXX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M3LPQZLQHJXXANLJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M3LPQZLQ","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M3LPQZLQHJXXANLJVT6SX2TGVR","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T16:17:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"779aeaa0ae106942547bad5a5b1e52663b650fd1064b3dc3fb03462f52fa9a5a","abstract_canon_sha256":"4f8bf9aaba17d0a95c27d530546ee274ea56795640621427eef459c95356a55c"},"schema_version":"1.0"},"canonical_sha256":"66d6f865703a6f703569acfd2bea66ac6ee50c99d4704fc3bc4ce5e0cbaffd6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:40.031697Z","signature_b64":"xCOLAS38vRpwRaP2OdR8Y1oIjy9S3nMKQVQNXgzSiyz2gt9dBnru3HLEC3fYiYyg4Sc4xsMNzY6O+Av4h9x9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d6f865703a6f703569acfd2bea66ac6ee50c99d4704fc3bc4ce5e0cbaffd6e","last_reissued_at":"2026-05-18T00:20:40.030950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:40.030950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03040","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-05-18T00:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OKC3CCkeGbZDJYCpV93pp9POFMXLKWCg8254MjowfURRG1gyL68vI5JctygM2UO529oP3H97g10NlZtztkl1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:02:42.284383Z"},"content_sha256":"be1160bb0402a0d3c62fea968b2a7c4d66d8aa9b8e2b3422db2852e0bfd6d9f7","schema_version":"1.0","event_id":"sha256:be1160bb0402a0d3c62fea968b2a7c4d66d8aa9b8e2b3422db2852e0bfd6d9f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M3LPQZLQHJXXANLJVT6SX2TGVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Problems on Matchings and Independent Sets of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amitava Bhattacharya, Anupam Mondal, T. Srinivasa Murthy","submitted_at":"2017-01-11T16:17:37Z","abstract_excerpt":"Let $G$ be a finite simple graph. For $X \\subset V(G)$, the difference of $X$, $d(X) := |X| - |N (X)|$ where $N(X)$ is the neighborhood of $X$ and $\\max \\, \\{d(X):X\\subset V(G)\\}$ is called the critical difference of $G$. $X$ is called a critical set if $d(X)$ equals the critical difference and ker$(G)$ is the intersection of all critical sets. It is known that ker$(G)$ is an independent (vertex) set of $G$. diadem$(G)$ is the union of all critical independent sets. An independent set $S$ is an inclusion minimal set with $d(S) > 0$ if no proper subset of $S$ has positive difference.\n  A graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03040","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":""},"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:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MfrHoeknYiyzBJ5Sil3wcVAX0F8pp0TXATiwFs3bfZyRS6lwdLP/+hA6rkbBTuIuK1ifhOmES1C7LjYpLsT7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:02:42.284738Z"},"content_sha256":"ffb0baca321636a81439399cdf5f84d441ebab43b4f64acfe0759535214b46c7","schema_version":"1.0","event_id":"sha256:ffb0baca321636a81439399cdf5f84d441ebab43b4f64acfe0759535214b46c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3LPQZLQHJXXANLJVT6SX2TGVR/bundle.json","state_url":"https://pith.science/pith/M3LPQZLQHJXXANLJVT6SX2TGVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3LPQZLQHJXXANLJVT6SX2TGVR/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-01T20:02:42Z","links":{"resolver":"https://pith.science/pith/M3LPQZLQHJXXANLJVT6SX2TGVR","bundle":"https://pith.science/pith/M3LPQZLQHJXXANLJVT6SX2TGVR/bundle.json","state":"https://pith.science/pith/M3LPQZLQHJXXANLJVT6SX2TGVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3LPQZLQHJXXANLJVT6SX2TGVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M3LPQZLQHJXXANLJVT6SX2TGVR","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":"4f8bf9aaba17d0a95c27d530546ee274ea56795640621427eef459c95356a55c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T16:17:37Z","title_canon_sha256":"779aeaa0ae106942547bad5a5b1e52663b650fd1064b3dc3fb03462f52fa9a5a"},"schema_version":"1.0","source":{"id":"1701.03040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03040","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03040v2","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03040","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"M3LPQZLQHJXX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M3LPQZLQHJXXANLJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M3LPQZLQ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:ffb0baca321636a81439399cdf5f84d441ebab43b4f64acfe0759535214b46c7","target":"graph","created_at":"2026-05-18T00:20:40Z","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":"Let $G$ be a finite simple graph. For $X \\subset V(G)$, the difference of $X$, $d(X) := |X| - |N (X)|$ where $N(X)$ is the neighborhood of $X$ and $\\max \\, \\{d(X):X\\subset V(G)\\}$ is called the critical difference of $G$. $X$ is called a critical set if $d(X)$ equals the critical difference and ker$(G)$ is the intersection of all critical sets. It is known that ker$(G)$ is an independent (vertex) set of $G$. diadem$(G)$ is the union of all critical independent sets. An independent set $S$ is an inclusion minimal set with $d(S) > 0$ if no proper subset of $S$ has positive difference.\n  A graph ","authors_text":"Amitava Bhattacharya, Anupam Mondal, T. Srinivasa Murthy","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T16:17:37Z","title":"Problems on Matchings and Independent Sets of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03040","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:be1160bb0402a0d3c62fea968b2a7c4d66d8aa9b8e2b3422db2852e0bfd6d9f7","target":"record","created_at":"2026-05-18T00:20:40Z","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":"4f8bf9aaba17d0a95c27d530546ee274ea56795640621427eef459c95356a55c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T16:17:37Z","title_canon_sha256":"779aeaa0ae106942547bad5a5b1e52663b650fd1064b3dc3fb03462f52fa9a5a"},"schema_version":"1.0","source":{"id":"1701.03040","kind":"arxiv","version":2}},"canonical_sha256":"66d6f865703a6f703569acfd2bea66ac6ee50c99d4704fc3bc4ce5e0cbaffd6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66d6f865703a6f703569acfd2bea66ac6ee50c99d4704fc3bc4ce5e0cbaffd6e","first_computed_at":"2026-05-18T00:20:40.030950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:40.030950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xCOLAS38vRpwRaP2OdR8Y1oIjy9S3nMKQVQNXgzSiyz2gt9dBnru3HLEC3fYiYyg4Sc4xsMNzY6O+Av4h9x9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:40.031697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be1160bb0402a0d3c62fea968b2a7c4d66d8aa9b8e2b3422db2852e0bfd6d9f7","sha256:ffb0baca321636a81439399cdf5f84d441ebab43b4f64acfe0759535214b46c7"],"state_sha256":"ba9520676e35b59d25c23fdeb0ade20b280c036189384953c6ae8434fd3ec25a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AcqyHiSCs/h4eyT8LOdybhKYAzPQ6/jsO95QGpbhMc+8nEKMaJKnv6Zi3RjLxKF2AVUaninKr9zoA5JQb8EeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:02:42.286744Z","bundle_sha256":"fb0162115b84947ccf675f88d3411d8d40a49e2382c818cdc4aa73be31fd3ed3"}}