{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E2ZCI4UBJC3W7G636EJ2ILJAZ6","short_pith_number":"pith:E2ZCI4UB","canonical_record":{"source":{"id":"1702.05873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"37bcb5ae59a9de7de2fd0e094c09419deca820deda4c1eb9884e383af9f8bf85","abstract_canon_sha256":"77438dd717d70f75620d79dcb6eade6b949581c169ee998714a3e7bf7f0e3061"},"schema_version":"1.0"},"canonical_sha256":"26b224728148b76f9bdbf113a42d20cf818e09907d0b12d94ceb50a2d79e6ac8","source":{"kind":"arxiv","id":"1702.05873","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05873","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05873v2","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05873","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"E2ZCI4UBJC3W","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E2ZCI4UBJC3W7G63","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E2ZCI4UB","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E2ZCI4UBJC3W7G636EJ2ILJAZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"37bcb5ae59a9de7de2fd0e094c09419deca820deda4c1eb9884e383af9f8bf85","abstract_canon_sha256":"77438dd717d70f75620d79dcb6eade6b949581c169ee998714a3e7bf7f0e3061"},"schema_version":"1.0"},"canonical_sha256":"26b224728148b76f9bdbf113a42d20cf818e09907d0b12d94ceb50a2d79e6ac8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:34.769636Z","signature_b64":"DbD+IADvV7u+IbvrTPV/lwZOvOgefvyc3fdmQ3GoY6OIH4HEXFidN5TBjWF0XlV8FdFgTjnHdhQF4roFkwPDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26b224728148b76f9bdbf113a42d20cf818e09907d0b12d94ceb50a2d79e6ac8","last_reissued_at":"2026-05-18T00:14:34.768986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:34.768986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05873","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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7VXXXaFw0qhtw7z1gxDvEGMH4RwLwMcupZqPvLFkoXmL4RUiWvzaiQtujwllz+timeB6PYMZV8ELNAcIAFu9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:34:54.381800Z"},"content_sha256":"0a79e4995491560d0f90ae6f0928987b81b4b7445679abcfeed1952d5b170a4b","schema_version":"1.0","event_id":"sha256:0a79e4995491560d0f90ae6f0928987b81b4b7445679abcfeed1952d5b170a4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E2ZCI4UBJC3W7G636EJ2ILJAZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization of 1-Tough Graphs using Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H. Lu, M. Kano","submitted_at":"2017-02-20T06:30:18Z","abstract_excerpt":"For a graph $G$, let $odd(G)$ and $\\omega(G)$ denote the number of odd components and the number of components of $G$, respectively. Then it is well-known that $G$ has a 1-factor if and only if $odd(G-S)\\le |S|$ for all $S\\subset V(G)$. Also it is clear that $odd(G-S) \\le \\omega(G-S)$. In this paper we characterize a 1-tough graph $G$, which satisfies $\\omega(G-S) \\le |S|$ for all $\\emptyset \\ne S \\subset V(G)$, using an $H$-factor of a set-valued function $H:V(G) \\to \\{ \\{1\\}, \\{0,2\\} \\}$. Moreover, we generalize this characterization to a graph that satisfies $\\omega(G-S) \\le f(S)$ for all $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05873","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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OI0Oos/jrJ1mi+mpaTbS/DWNiIpRYCkFn4A1741i6vkJLwLqwdjPG8cMvFuwOuvCmALfa0pmc0XWuuY8r6vbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:34:54.382485Z"},"content_sha256":"f171366256492021069e25c6448353e1f5b588b98a20681ec941a8a7d8e00aa8","schema_version":"1.0","event_id":"sha256:f171366256492021069e25c6448353e1f5b588b98a20681ec941a8a7d8e00aa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2ZCI4UBJC3W7G636EJ2ILJAZ6/bundle.json","state_url":"https://pith.science/pith/E2ZCI4UBJC3W7G636EJ2ILJAZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2ZCI4UBJC3W7G636EJ2ILJAZ6/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-26T12:34:54Z","links":{"resolver":"https://pith.science/pith/E2ZCI4UBJC3W7G636EJ2ILJAZ6","bundle":"https://pith.science/pith/E2ZCI4UBJC3W7G636EJ2ILJAZ6/bundle.json","state":"https://pith.science/pith/E2ZCI4UBJC3W7G636EJ2ILJAZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2ZCI4UBJC3W7G636EJ2ILJAZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E2ZCI4UBJC3W7G636EJ2ILJAZ6","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":"77438dd717d70f75620d79dcb6eade6b949581c169ee998714a3e7bf7f0e3061","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:30:18Z","title_canon_sha256":"37bcb5ae59a9de7de2fd0e094c09419deca820deda4c1eb9884e383af9f8bf85"},"schema_version":"1.0","source":{"id":"1702.05873","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05873","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05873v2","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05873","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"E2ZCI4UBJC3W","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E2ZCI4UBJC3W7G63","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E2ZCI4UB","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:f171366256492021069e25c6448353e1f5b588b98a20681ec941a8a7d8e00aa8","target":"graph","created_at":"2026-05-18T00:14:34Z","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":"For a graph $G$, let $odd(G)$ and $\\omega(G)$ denote the number of odd components and the number of components of $G$, respectively. Then it is well-known that $G$ has a 1-factor if and only if $odd(G-S)\\le |S|$ for all $S\\subset V(G)$. Also it is clear that $odd(G-S) \\le \\omega(G-S)$. In this paper we characterize a 1-tough graph $G$, which satisfies $\\omega(G-S) \\le |S|$ for all $\\emptyset \\ne S \\subset V(G)$, using an $H$-factor of a set-valued function $H:V(G) \\to \\{ \\{1\\}, \\{0,2\\} \\}$. Moreover, we generalize this characterization to a graph that satisfies $\\omega(G-S) \\le f(S)$ for all $","authors_text":"H. Lu, M. Kano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:30:18Z","title":"Characterization of 1-Tough Graphs using Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05873","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:0a79e4995491560d0f90ae6f0928987b81b4b7445679abcfeed1952d5b170a4b","target":"record","created_at":"2026-05-18T00:14:34Z","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":"77438dd717d70f75620d79dcb6eade6b949581c169ee998714a3e7bf7f0e3061","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:30:18Z","title_canon_sha256":"37bcb5ae59a9de7de2fd0e094c09419deca820deda4c1eb9884e383af9f8bf85"},"schema_version":"1.0","source":{"id":"1702.05873","kind":"arxiv","version":2}},"canonical_sha256":"26b224728148b76f9bdbf113a42d20cf818e09907d0b12d94ceb50a2d79e6ac8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26b224728148b76f9bdbf113a42d20cf818e09907d0b12d94ceb50a2d79e6ac8","first_computed_at":"2026-05-18T00:14:34.768986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:34.768986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DbD+IADvV7u+IbvrTPV/lwZOvOgefvyc3fdmQ3GoY6OIH4HEXFidN5TBjWF0XlV8FdFgTjnHdhQF4roFkwPDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:34.769636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05873","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a79e4995491560d0f90ae6f0928987b81b4b7445679abcfeed1952d5b170a4b","sha256:f171366256492021069e25c6448353e1f5b588b98a20681ec941a8a7d8e00aa8"],"state_sha256":"8f2b69fda4f522f68ae1630f1f2eef595b8f051f1cec0e91254d35c01c4db23b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XXJ4v6XS/sdg7cF20qInNPAXsXgKc3SVtN+toKBxOiBAAK/FuNmwqZJpfjs6ZkSc5I8UyAoKLhzK0ciyzgaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:34:54.386082Z","bundle_sha256":"ae075e34eafafb79d733ed90503ba1c1bad853d0064b2333d2f2c1071e04b09b"}}