{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QOVNNG6ENSCDVM76GANYXCVY3A","short_pith_number":"pith:QOVNNG6E","canonical_record":{"source":{"id":"2401.05696","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-11T06:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"8868f79ac454f7afc9780db1227c6973d7029723c6f65896ef37d8b5f4c17cd4","abstract_canon_sha256":"695d11d02e5afa4a11e6abef4516d254c7c3df8cf3460cb85e2227c3c29ce399"},"schema_version":"1.0"},"canonical_sha256":"83aad69bc46c843ab3fe301b8b8ab8d832aa978540ecba7de6b91af582a35541","source":{"kind":"arxiv","id":"2401.05696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.05696","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"arxiv_version","alias_value":"2401.05696v1","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05696","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"pith_short_12","alias_value":"QOVNNG6ENSCD","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"pith_short_16","alias_value":"QOVNNG6ENSCDVM76","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"pith_short_8","alias_value":"QOVNNG6E","created_at":"2026-07-05T07:32:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QOVNNG6ENSCDVM76GANYXCVY3A","target":"record","payload":{"canonical_record":{"source":{"id":"2401.05696","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-11T06:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"8868f79ac454f7afc9780db1227c6973d7029723c6f65896ef37d8b5f4c17cd4","abstract_canon_sha256":"695d11d02e5afa4a11e6abef4516d254c7c3df8cf3460cb85e2227c3c29ce399"},"schema_version":"1.0"},"canonical_sha256":"83aad69bc46c843ab3fe301b8b8ab8d832aa978540ecba7de6b91af582a35541","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:34.091929Z","signature_b64":"DdVXgCiKUM+StyrKsn7CnKY2WVK8c3ucnL4+BT1pZB0e5p/huIqLNGulx6r8NkUvW6U8fcMWl6EoXCtNZtkJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83aad69bc46c843ab3fe301b8b8ab8d832aa978540ecba7de6b91af582a35541","last_reissued_at":"2026-07-05T07:32:34.091324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:34.091324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.05696","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-05T07:32:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0KwG/Bli3+OW0ax/I7n7CWeyKQjduN1tG9hGDlwlRrYt4SMCckDSgwciSnp501lMHeGODJTKNo50qYo+x1UDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:23:06.756710Z"},"content_sha256":"98ba62b0145608a1102c8e8be15519d0aa5ef58ff1c68042230d16b538594dea","schema_version":"1.0","event_id":"sha256:98ba62b0145608a1102c8e8be15519d0aa5ef58ff1c68042230d16b538594dea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QOVNNG6ENSCDVM76GANYXCVY3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General position polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregor Rus, James Tuite, Sandi Klav\\v{z}ar, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2024-01-11T06:45:29Z","abstract_excerpt":"A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$. In this paper we introduce the general position polynomial as $\\sum_{i \\geq 0} a_i x^i$, where $a_i$ is the number of distinct general position sets of $G$ with cardinality $i$. The polynomial is considered for several well-known classes of graphs and graph operations. It is shown that the polynomial is not unimodal in general, not even on trees. On the other hand, several classes of graphs, including Kneser graphs $K(n,2)$, with unimodal general position po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05696","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/2401.05696/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-05T07:32:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNRfqBUKZcNQyDRMeCqqjVciJ/OTI/WhrtsVgGvSbXiiVCVmX/8hBCq5V9jACKeT3RrjfLDGqdoewi0IniTwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:23:06.757212Z"},"content_sha256":"29a5697b09d1e391fa9d246d4b75ef818413b74e574441ed10ac8ae329b2cf8f","schema_version":"1.0","event_id":"sha256:29a5697b09d1e391fa9d246d4b75ef818413b74e574441ed10ac8ae329b2cf8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOVNNG6ENSCDVM76GANYXCVY3A/bundle.json","state_url":"https://pith.science/pith/QOVNNG6ENSCDVM76GANYXCVY3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOVNNG6ENSCDVM76GANYXCVY3A/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-18T18:23:06Z","links":{"resolver":"https://pith.science/pith/QOVNNG6ENSCDVM76GANYXCVY3A","bundle":"https://pith.science/pith/QOVNNG6ENSCDVM76GANYXCVY3A/bundle.json","state":"https://pith.science/pith/QOVNNG6ENSCDVM76GANYXCVY3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOVNNG6ENSCDVM76GANYXCVY3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QOVNNG6ENSCDVM76GANYXCVY3A","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":"695d11d02e5afa4a11e6abef4516d254c7c3df8cf3460cb85e2227c3c29ce399","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-11T06:45:29Z","title_canon_sha256":"8868f79ac454f7afc9780db1227c6973d7029723c6f65896ef37d8b5f4c17cd4"},"schema_version":"1.0","source":{"id":"2401.05696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.05696","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"arxiv_version","alias_value":"2401.05696v1","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05696","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"pith_short_12","alias_value":"QOVNNG6ENSCD","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"pith_short_16","alias_value":"QOVNNG6ENSCDVM76","created_at":"2026-07-05T07:32:34Z"},{"alias_kind":"pith_short_8","alias_value":"QOVNNG6E","created_at":"2026-07-05T07:32:34Z"}],"graph_snapshots":[{"event_id":"sha256:29a5697b09d1e391fa9d246d4b75ef818413b74e574441ed10ac8ae329b2cf8f","target":"graph","created_at":"2026-07-05T07:32: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.05696/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$. In this paper we introduce the general position polynomial as $\\sum_{i \\geq 0} a_i x^i$, where $a_i$ is the number of distinct general position sets of $G$ with cardinality $i$. The polynomial is considered for several well-known classes of graphs and graph operations. It is shown that the polynomial is not unimodal in general, not even on trees. On the other hand, several classes of graphs, including Kneser graphs $K(n,2)$, with unimodal general position po","authors_text":"Gregor Rus, James Tuite, Sandi Klav\\v{z}ar, Vesna Ir\\v{s}i\\v{c}","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-11T06:45:29Z","title":"General position polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05696","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:98ba62b0145608a1102c8e8be15519d0aa5ef58ff1c68042230d16b538594dea","target":"record","created_at":"2026-07-05T07:32: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":"695d11d02e5afa4a11e6abef4516d254c7c3df8cf3460cb85e2227c3c29ce399","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-11T06:45:29Z","title_canon_sha256":"8868f79ac454f7afc9780db1227c6973d7029723c6f65896ef37d8b5f4c17cd4"},"schema_version":"1.0","source":{"id":"2401.05696","kind":"arxiv","version":1}},"canonical_sha256":"83aad69bc46c843ab3fe301b8b8ab8d832aa978540ecba7de6b91af582a35541","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83aad69bc46c843ab3fe301b8b8ab8d832aa978540ecba7de6b91af582a35541","first_computed_at":"2026-07-05T07:32:34.091324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:32:34.091324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DdVXgCiKUM+StyrKsn7CnKY2WVK8c3ucnL4+BT1pZB0e5p/huIqLNGulx6r8NkUvW6U8fcMWl6EoXCtNZtkJAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:32:34.091929Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.05696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98ba62b0145608a1102c8e8be15519d0aa5ef58ff1c68042230d16b538594dea","sha256:29a5697b09d1e391fa9d246d4b75ef818413b74e574441ed10ac8ae329b2cf8f"],"state_sha256":"0b49052cd5510b17ff2bac172fd4f68bf7adc49b5f238d268cc62ec707076884"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dHyuuPsjXhrAG2sCwEwTPf2E3i8szYMQzwTFO5yHTqbITcbR9VRP95r97mN1woMM2qtNqkjkXyuWBvIn7koBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:23:06.762630Z","bundle_sha256":"f153eb8d32c09f70430788c9a691d0a0ae6d088cc2410a0c53eac0a72a9f9bbd"}}