{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D47QD7XNWFZWN7EV3XXUBV2ADU","short_pith_number":"pith:D47QD7XN","canonical_record":{"source":{"id":"1706.04734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-15T04:26:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bbf680946131772754f06126e596f213213f5ba59e0da39b7cd50e6e882b2739","abstract_canon_sha256":"4b0c2ba7bf60b2acf81be7d9d1a0d01eda88b7dbe22a21e3a0e5ba4ecbf469b3"},"schema_version":"1.0"},"canonical_sha256":"1f3f01feedb17366fc95ddef40d7401d09b774f61a407818cd757a02bcac00a5","source":{"kind":"arxiv","id":"1706.04734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04734","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04734v1","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04734","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"pith_short_12","alias_value":"D47QD7XNWFZW","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D47QD7XNWFZWN7EV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D47QD7XN","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D47QD7XNWFZWN7EV3XXUBV2ADU","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-15T04:26:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bbf680946131772754f06126e596f213213f5ba59e0da39b7cd50e6e882b2739","abstract_canon_sha256":"4b0c2ba7bf60b2acf81be7d9d1a0d01eda88b7dbe22a21e3a0e5ba4ecbf469b3"},"schema_version":"1.0"},"canonical_sha256":"1f3f01feedb17366fc95ddef40d7401d09b774f61a407818cd757a02bcac00a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:19.286802Z","signature_b64":"LuoBII372/UfRMVnX7SHsAIADfnOP0sbNlPKNSvZVr8GBvrH/jHNiRbjyiGYrW3IyHPnMiMQyqNPkIXB5AK/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f3f01feedb17366fc95ddef40d7401d09b774f61a407818cd757a02bcac00a5","last_reissued_at":"2026-05-18T00:42:19.286178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:19.286178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04734","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-18T00:42:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kfsab4RM2jGHX2CEn5swtlqHV/dmfAmCKemIDLwXLe4iaan5PLUTKKgOYxXhOHf2obk0OjnTaeNV6Ojj7OXTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:08:13.900023Z"},"content_sha256":"61bf0c13adfb5b823dd741cd6f3bef32604e457afa65ae54cb297f7693156810","schema_version":"1.0","event_id":"sha256:61bf0c13adfb5b823dd741cd6f3bef32604e457afa65ae54cb297f7693156810"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D47QD7XNWFZWN7EV3XXUBV2ADU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Functional Graphs of Quadratic Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Bernard Mans, Daniel Sutantyo, Igor E. Shparlinski, Min Sha","submitted_at":"2017-06-15T04:26:46Z","abstract_excerpt":"We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These include: the number of connected functional graphs, the number of graphs having a maximal cycle, the number of cycles of fixed size, the number of components of fixed size, as well as the shape of trees extracted from functional graphs. We particularly focus on connected functional graphs, that is, the graphs which contain only one component (and thus only "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04734","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-18T00:42:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1OAmeNPs2FpEFHOJqHR/D9svyQkWKrAYFb5D0CK7kdJLYFQFHsjb6/v0V2rEEOdLoC69qa8WimhzyulYWuRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:08:13.900695Z"},"content_sha256":"e6f1a61399d7ff9df8f4649269f2e4c7b52e0088f0f14b410e2663e96ca7a38f","schema_version":"1.0","event_id":"sha256:e6f1a61399d7ff9df8f4649269f2e4c7b52e0088f0f14b410e2663e96ca7a38f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D47QD7XNWFZWN7EV3XXUBV2ADU/bundle.json","state_url":"https://pith.science/pith/D47QD7XNWFZWN7EV3XXUBV2ADU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D47QD7XNWFZWN7EV3XXUBV2ADU/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-28T21:08:13Z","links":{"resolver":"https://pith.science/pith/D47QD7XNWFZWN7EV3XXUBV2ADU","bundle":"https://pith.science/pith/D47QD7XNWFZWN7EV3XXUBV2ADU/bundle.json","state":"https://pith.science/pith/D47QD7XNWFZWN7EV3XXUBV2ADU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D47QD7XNWFZWN7EV3XXUBV2ADU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D47QD7XNWFZWN7EV3XXUBV2ADU","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":"4b0c2ba7bf60b2acf81be7d9d1a0d01eda88b7dbe22a21e3a0e5ba4ecbf469b3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-15T04:26:46Z","title_canon_sha256":"bbf680946131772754f06126e596f213213f5ba59e0da39b7cd50e6e882b2739"},"schema_version":"1.0","source":{"id":"1706.04734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04734","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04734v1","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04734","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"pith_short_12","alias_value":"D47QD7XNWFZW","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D47QD7XNWFZWN7EV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D47QD7XN","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:e6f1a61399d7ff9df8f4649269f2e4c7b52e0088f0f14b410e2663e96ca7a38f","target":"graph","created_at":"2026-05-18T00:42:19Z","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":"We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These include: the number of connected functional graphs, the number of graphs having a maximal cycle, the number of cycles of fixed size, the number of components of fixed size, as well as the shape of trees extracted from functional graphs. We particularly focus on connected functional graphs, that is, the graphs which contain only one component (and thus only ","authors_text":"Bernard Mans, Daniel Sutantyo, Igor E. Shparlinski, Min Sha","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-15T04:26:46Z","title":"On Functional Graphs of Quadratic Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04734","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:61bf0c13adfb5b823dd741cd6f3bef32604e457afa65ae54cb297f7693156810","target":"record","created_at":"2026-05-18T00:42:19Z","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":"4b0c2ba7bf60b2acf81be7d9d1a0d01eda88b7dbe22a21e3a0e5ba4ecbf469b3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-15T04:26:46Z","title_canon_sha256":"bbf680946131772754f06126e596f213213f5ba59e0da39b7cd50e6e882b2739"},"schema_version":"1.0","source":{"id":"1706.04734","kind":"arxiv","version":1}},"canonical_sha256":"1f3f01feedb17366fc95ddef40d7401d09b774f61a407818cd757a02bcac00a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f3f01feedb17366fc95ddef40d7401d09b774f61a407818cd757a02bcac00a5","first_computed_at":"2026-05-18T00:42:19.286178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:19.286178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LuoBII372/UfRMVnX7SHsAIADfnOP0sbNlPKNSvZVr8GBvrH/jHNiRbjyiGYrW3IyHPnMiMQyqNPkIXB5AK/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:19.286802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61bf0c13adfb5b823dd741cd6f3bef32604e457afa65ae54cb297f7693156810","sha256:e6f1a61399d7ff9df8f4649269f2e4c7b52e0088f0f14b410e2663e96ca7a38f"],"state_sha256":"5349961bf984f818ffed4ad3d56bbc91a7972392974c100a27142f219af2156a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bjTptMzjg2ThXrZsZxO8wiieToSYa2TRvUNniImpgaTcN7F++yKlsSGQoE8UsbigpEmqF6yFkv+LrLKyTt3QAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:08:13.904015Z","bundle_sha256":"f0adaf608b2fca87251f8076669771b55f352c7c1e1bce8b299d09ba3ea278dc"}}