{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6VM5L5YLGHOHDWE7XRCM2YFPAY","short_pith_number":"pith:6VM5L5YL","canonical_record":{"source":{"id":"1606.02660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-08T17:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"2ad53b7d2cb104626db7adc16d3a50ed0ae79287e14a4d84ed8019d448d9eef2","abstract_canon_sha256":"91c6a6acb759e9c01be9f6eaac000dc35150e3a72576155f8b252309474b7fd8"},"schema_version":"1.0"},"canonical_sha256":"f559d5f70b31dc71d89fbc44cd60af061a90c45b9e5dcd45cccd26fbdc43688d","source":{"kind":"arxiv","id":"1606.02660","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02660","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02660v1","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02660","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"pith_short_12","alias_value":"6VM5L5YLGHOH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6VM5L5YLGHOHDWE7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6VM5L5YL","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6VM5L5YLGHOHDWE7XRCM2YFPAY","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-08T17:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"2ad53b7d2cb104626db7adc16d3a50ed0ae79287e14a4d84ed8019d448d9eef2","abstract_canon_sha256":"91c6a6acb759e9c01be9f6eaac000dc35150e3a72576155f8b252309474b7fd8"},"schema_version":"1.0"},"canonical_sha256":"f559d5f70b31dc71d89fbc44cd60af061a90c45b9e5dcd45cccd26fbdc43688d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:40.890552Z","signature_b64":"dVxd24zvn6ZZ1q6bsPzAC4EDafOi63JYKIgp5+XMloAkB0DR0gSm3Gy8NErvHJVRT2ZayXyIXPXAIVC3JVmKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f559d5f70b31dc71d89fbc44cd60af061a90c45b9e5dcd45cccd26fbdc43688d","last_reissued_at":"2026-05-18T01:12:40.890177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:40.890177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02660","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-18T01:12:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnQluKTKIAbR2pq4qVUfBeY4SzyZsUXF7enwf+nlHu0eNF8d1w1xyLa7hsP0P+FAQ765i74dWI8XhWADj60mBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:37:12.533840Z"},"content_sha256":"b90badebd96af2ff54ae45438895de60cf3fc80cf12d68828f6a92ab17f6816a","schema_version":"1.0","event_id":"sha256:b90badebd96af2ff54ae45438895de60cf3fc80cf12d68828f6a92ab17f6816a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6VM5L5YLGHOHDWE7XRCM2YFPAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homomorphisms into loop-threshold graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Cutler, Nicholas Kass","submitted_at":"2016-06-08T17:55:50Z","abstract_excerpt":"Many problems in extremal graph theory correspond to questions involving homomorphisms into a fixed image graph. Recently, there has been interest in maximizing the number of homomorphisms from graphs with a fixed number of vertices and edges into small image graphs. For the image graph $H_{\\text{ind}}$, the graph on two adjacent vertices, one of which is looped, each homomorphism from $G$ to $H_{\\text{ind}}$ corresponds to an independent set in $G$. It follows from the Kruskal-Katona theorem that the number of homomorphisms to $H_{\\text{ind}}$ is maximized by the lex graph, whose edges form a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02660","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-18T01:12:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hQ1CDQMwdBMIw2HodrpKTp3lT1Iv9hHAJXs9tgUk1fD+j+LPplheHBETVE91oboWxsXhniu0xSYW8kxsky7LDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:37:12.534178Z"},"content_sha256":"449598566f28c6c7f02b8163b35311727df26cad55f5e1cf43de1e9344da4824","schema_version":"1.0","event_id":"sha256:449598566f28c6c7f02b8163b35311727df26cad55f5e1cf43de1e9344da4824"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VM5L5YLGHOHDWE7XRCM2YFPAY/bundle.json","state_url":"https://pith.science/pith/6VM5L5YLGHOHDWE7XRCM2YFPAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VM5L5YLGHOHDWE7XRCM2YFPAY/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-03T01:37:12Z","links":{"resolver":"https://pith.science/pith/6VM5L5YLGHOHDWE7XRCM2YFPAY","bundle":"https://pith.science/pith/6VM5L5YLGHOHDWE7XRCM2YFPAY/bundle.json","state":"https://pith.science/pith/6VM5L5YLGHOHDWE7XRCM2YFPAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VM5L5YLGHOHDWE7XRCM2YFPAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6VM5L5YLGHOHDWE7XRCM2YFPAY","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":"91c6a6acb759e9c01be9f6eaac000dc35150e3a72576155f8b252309474b7fd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-08T17:55:50Z","title_canon_sha256":"2ad53b7d2cb104626db7adc16d3a50ed0ae79287e14a4d84ed8019d448d9eef2"},"schema_version":"1.0","source":{"id":"1606.02660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02660","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02660v1","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02660","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"pith_short_12","alias_value":"6VM5L5YLGHOH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6VM5L5YLGHOHDWE7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6VM5L5YL","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:449598566f28c6c7f02b8163b35311727df26cad55f5e1cf43de1e9344da4824","target":"graph","created_at":"2026-05-18T01:12: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":"Many problems in extremal graph theory correspond to questions involving homomorphisms into a fixed image graph. Recently, there has been interest in maximizing the number of homomorphisms from graphs with a fixed number of vertices and edges into small image graphs. For the image graph $H_{\\text{ind}}$, the graph on two adjacent vertices, one of which is looped, each homomorphism from $G$ to $H_{\\text{ind}}$ corresponds to an independent set in $G$. It follows from the Kruskal-Katona theorem that the number of homomorphisms to $H_{\\text{ind}}$ is maximized by the lex graph, whose edges form a","authors_text":"Jonathan Cutler, Nicholas Kass","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-08T17:55:50Z","title":"Homomorphisms into loop-threshold graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02660","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:b90badebd96af2ff54ae45438895de60cf3fc80cf12d68828f6a92ab17f6816a","target":"record","created_at":"2026-05-18T01:12: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":"91c6a6acb759e9c01be9f6eaac000dc35150e3a72576155f8b252309474b7fd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-08T17:55:50Z","title_canon_sha256":"2ad53b7d2cb104626db7adc16d3a50ed0ae79287e14a4d84ed8019d448d9eef2"},"schema_version":"1.0","source":{"id":"1606.02660","kind":"arxiv","version":1}},"canonical_sha256":"f559d5f70b31dc71d89fbc44cd60af061a90c45b9e5dcd45cccd26fbdc43688d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f559d5f70b31dc71d89fbc44cd60af061a90c45b9e5dcd45cccd26fbdc43688d","first_computed_at":"2026-05-18T01:12:40.890177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:40.890177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dVxd24zvn6ZZ1q6bsPzAC4EDafOi63JYKIgp5+XMloAkB0DR0gSm3Gy8NErvHJVRT2ZayXyIXPXAIVC3JVmKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:40.890552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b90badebd96af2ff54ae45438895de60cf3fc80cf12d68828f6a92ab17f6816a","sha256:449598566f28c6c7f02b8163b35311727df26cad55f5e1cf43de1e9344da4824"],"state_sha256":"e6de38a3242bcc7910aa61554fa5cda30f3931f2d8ac4c36102195f1cb68a867"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLWEMlq26U0rzeXADBur8PZ2SC2YzzKNfA4sMB1URJZRoLxc809IdIGhDVJLkEs9K7qmWLQgw4ub/TJ/yAqpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:37:12.536099Z","bundle_sha256":"3b2842b6e9219cec645cdb32f5f8329e34771dad29c5831f60dae9672fbcfb09"}}