{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:JRFNUEV6DHTY4H5U4H2ILEAZN7","short_pith_number":"pith:JRFNUEV6","schema_version":"1.0","canonical_sha256":"4c4ada12be19e78e1fb4e1f48590196ff87d1fbabea8c4d53124e8151004ccb3","source":{"kind":"arxiv","id":"0805.1672","version":1},"attestation_state":"computed","paper":{"title":"Universal Cycles of Discrete Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant P. Godbole, Ashley Bechel, Britni LaBounty-Lay","submitted_at":"2008-05-12T15:46:22Z","abstract_excerpt":"A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also known as deBruijn cycles or $U$-cycles) of several combinatorial objects. We present new results on the existence of universal cycles of certain classes of functions. These include onto functions, and 1-inequitable sequences on a binary alphabet. In each case the connectedness of the underlying graph is the non-trivial aspect to be established."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0805.1672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-05-12T15:46:22Z","cross_cats_sorted":[],"title_canon_sha256":"4aed6b903a7991bffe1a0fcb27a2a1dc3363f4fe4c7592b4627ecf50c2ebdf14","abstract_canon_sha256":"33a175d24551688eb4a07ea994c51bee7afcf0ecf8fca1d5cbfcfbcf50336434"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:05.204545Z","signature_b64":"Bo+UR1150sVQ/sKaSnsSDMNSZvhRrEb2EDi3XVOUIrRkWtGooZBTCmJe5+uNs8VgASYV0wc6JgxUppaErjtmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c4ada12be19e78e1fb4e1f48590196ff87d1fbabea8c4d53124e8151004ccb3","last_reissued_at":"2026-05-18T03:58:05.204034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:05.204034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Cycles of Discrete Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant P. Godbole, Ashley Bechel, Britni LaBounty-Lay","submitted_at":"2008-05-12T15:46:22Z","abstract_excerpt":"A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also known as deBruijn cycles or $U$-cycles) of several combinatorial objects. We present new results on the existence of universal cycles of certain classes of functions. These include onto functions, and 1-inequitable sequences on a binary alphabet. In each case the connectedness of the underlying graph is the non-trivial aspect to be established."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1672","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0805.1672","created_at":"2026-05-18T03:58:05.204114+00:00"},{"alias_kind":"arxiv_version","alias_value":"0805.1672v1","created_at":"2026-05-18T03:58:05.204114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1672","created_at":"2026-05-18T03:58:05.204114+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRFNUEV6DHTY","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRFNUEV6DHTY4H5U","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRFNUEV6","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7","json":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7.json","graph_json":"https://pith.science/api/pith-number/JRFNUEV6DHTY4H5U4H2ILEAZN7/graph.json","events_json":"https://pith.science/api/pith-number/JRFNUEV6DHTY4H5U4H2ILEAZN7/events.json","paper":"https://pith.science/paper/JRFNUEV6"},"agent_actions":{"view_html":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7","download_json":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7.json","view_paper":"https://pith.science/paper/JRFNUEV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0805.1672&json=true","fetch_graph":"https://pith.science/api/pith-number/JRFNUEV6DHTY4H5U4H2ILEAZN7/graph.json","fetch_events":"https://pith.science/api/pith-number/JRFNUEV6DHTY4H5U4H2ILEAZN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7/action/storage_attestation","attest_author":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7/action/author_attestation","sign_citation":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7/action/citation_signature","submit_replication":"https://pith.science/pith/JRFNUEV6DHTY4H5U4H2ILEAZN7/action/replication_record"}},"created_at":"2026-05-18T03:58:05.204114+00:00","updated_at":"2026-05-18T03:58:05.204114+00:00"}