{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:X73C7BEPYLODAO7UOOWLATMZBU","short_pith_number":"pith:X73C7BEP","canonical_record":{"source":{"id":"1011.4726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T04:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"bc8c51ed93659db3f214bcb81f2ab364ffa62ebf71dda35da91632bfe1ed968a","abstract_canon_sha256":"bc030b123fcbe71baf4d2842b9dcc0be79d9c391fec77b9cfd926ea1325d0625"},"schema_version":"1.0"},"canonical_sha256":"bff62f848fc2dc303bf473acb04d990d3e71d8117be1039d503003835a04b087","source":{"kind":"arxiv","id":"1011.4726","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4726","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4726v2","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4726","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"X73C7BEPYLOD","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"X73C7BEPYLODAO7U","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"X73C7BEP","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:X73C7BEPYLODAO7UOOWLATMZBU","target":"record","payload":{"canonical_record":{"source":{"id":"1011.4726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T04:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"bc8c51ed93659db3f214bcb81f2ab364ffa62ebf71dda35da91632bfe1ed968a","abstract_canon_sha256":"bc030b123fcbe71baf4d2842b9dcc0be79d9c391fec77b9cfd926ea1325d0625"},"schema_version":"1.0"},"canonical_sha256":"bff62f848fc2dc303bf473acb04d990d3e71d8117be1039d503003835a04b087","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.695469Z","signature_b64":"TSVML5wfceY6wBkS0faIHTlDukwPK7SW+iabG2WjHcsjexHML4qrKCVgdtfilCn+Ez11sjuwcMQttnETKV+cCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff62f848fc2dc303bf473acb04d990d3e71d8117be1039d503003835a04b087","last_reissued_at":"2026-05-18T01:11:00.694837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.694837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.4726","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-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDkH0e2+Pl9pFy649/ldfGj+X+WdzbnaFTbCOsuqUWpMVuGNAij2OYAVlh0w4NwtktJv3e7n3biMgHN27CnWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:18:43.679942Z"},"content_sha256":"342dd660e909c8abfafaa9931494bae14b3a25d080a44844bebf39d0b477a387","schema_version":"1.0","event_id":"sha256:342dd660e909c8abfafaa9931494bae14b3a25d080a44844bebf39d0b477a387"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:X73C7BEPYLODAO7UOOWLATMZBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$H$-product and $H$-threshold graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pavel Skums","submitted_at":"2010-11-22T04:43:20Z","abstract_excerpt":"This paper is the continuation of the research of the author and his colleagues of the {\\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent the graph under study as a product of prime elements with respect to this operation. We consider the graph together with the arbitrary partition of its vertex set into $n$ subsets ($n$-partitioned graph). On the set of $n$-partitioned graphs distinguished up to isomorphism we consider the binary algebraic operation $\\circ_H$ ($H$-product of graphs), determin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4726","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-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XuFAwce5aNEv1HwPG9z0pU02Ue+bavhcxFi4RanoSGsptUyZnAD0dP4ZfcbrbgI29jnAQ+H/qJWObhbQxVe1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:18:43.680287Z"},"content_sha256":"7678e0f5b699c406bac60bdf21c11ac074fa3d5a70df8d05d61fb28249d35035","schema_version":"1.0","event_id":"sha256:7678e0f5b699c406bac60bdf21c11ac074fa3d5a70df8d05d61fb28249d35035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X73C7BEPYLODAO7UOOWLATMZBU/bundle.json","state_url":"https://pith.science/pith/X73C7BEPYLODAO7UOOWLATMZBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X73C7BEPYLODAO7UOOWLATMZBU/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-23T23:18:43Z","links":{"resolver":"https://pith.science/pith/X73C7BEPYLODAO7UOOWLATMZBU","bundle":"https://pith.science/pith/X73C7BEPYLODAO7UOOWLATMZBU/bundle.json","state":"https://pith.science/pith/X73C7BEPYLODAO7UOOWLATMZBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X73C7BEPYLODAO7UOOWLATMZBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:X73C7BEPYLODAO7UOOWLATMZBU","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":"bc030b123fcbe71baf4d2842b9dcc0be79d9c391fec77b9cfd926ea1325d0625","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T04:43:20Z","title_canon_sha256":"bc8c51ed93659db3f214bcb81f2ab364ffa62ebf71dda35da91632bfe1ed968a"},"schema_version":"1.0","source":{"id":"1011.4726","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4726","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4726v2","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4726","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"X73C7BEPYLOD","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"X73C7BEPYLODAO7U","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"X73C7BEP","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:7678e0f5b699c406bac60bdf21c11ac074fa3d5a70df8d05d61fb28249d35035","target":"graph","created_at":"2026-05-18T01:11:00Z","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":"This paper is the continuation of the research of the author and his colleagues of the {\\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent the graph under study as a product of prime elements with respect to this operation. We consider the graph together with the arbitrary partition of its vertex set into $n$ subsets ($n$-partitioned graph). On the set of $n$-partitioned graphs distinguished up to isomorphism we consider the binary algebraic operation $\\circ_H$ ($H$-product of graphs), determin","authors_text":"Pavel Skums","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T04:43:20Z","title":"$H$-product and $H$-threshold graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4726","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:342dd660e909c8abfafaa9931494bae14b3a25d080a44844bebf39d0b477a387","target":"record","created_at":"2026-05-18T01:11:00Z","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":"bc030b123fcbe71baf4d2842b9dcc0be79d9c391fec77b9cfd926ea1325d0625","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T04:43:20Z","title_canon_sha256":"bc8c51ed93659db3f214bcb81f2ab364ffa62ebf71dda35da91632bfe1ed968a"},"schema_version":"1.0","source":{"id":"1011.4726","kind":"arxiv","version":2}},"canonical_sha256":"bff62f848fc2dc303bf473acb04d990d3e71d8117be1039d503003835a04b087","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bff62f848fc2dc303bf473acb04d990d3e71d8117be1039d503003835a04b087","first_computed_at":"2026-05-18T01:11:00.694837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:00.694837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TSVML5wfceY6wBkS0faIHTlDukwPK7SW+iabG2WjHcsjexHML4qrKCVgdtfilCn+Ez11sjuwcMQttnETKV+cCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:00.695469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4726","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:342dd660e909c8abfafaa9931494bae14b3a25d080a44844bebf39d0b477a387","sha256:7678e0f5b699c406bac60bdf21c11ac074fa3d5a70df8d05d61fb28249d35035"],"state_sha256":"fdac1ca2a912b266106adddf04bb57dce34c32cb72631728fbfbcd631876ad50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BqzILdgycM98TbHZTgti8P4022oRGJjKmSO8+E9FReLgbBH9CFKihcfiDBI67R7kgAQrkGprQrg348otccVeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T23:18:43.682260Z","bundle_sha256":"5c97d5477d565b84092bd746418259fafd31e636720a850db41f4a9b4f510eb8"}}