{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:LVX7OCZGGEDWSMMROYAAQ6MBRK","short_pith_number":"pith:LVX7OCZG","schema_version":"1.0","canonical_sha256":"5d6ff70b26310769319176000879818abdafe4aa455887d16d932eced21b6f6f","source":{"kind":"arxiv","id":"0906.1689","version":4},"attestation_state":"computed","paper":{"title":"Monotone paths in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Matteo Novaga, Pietro Majer","submitted_at":"2009-06-09T15:26:13Z","abstract_excerpt":"We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\\mathbb N$. These graphs appear as line graph of uniform hypergraphs with vertex set $\\mathbb N$."},"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":"0906.1689","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-06-09T15:26:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"38da48be10b3424318b14af1917e34ad6e6188e252c9d1ee2790f265f68c6512","abstract_canon_sha256":"0f51c0f37604550ec63280f26215de98e17ab774f90b14b324cd68076725102d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:24.804948Z","signature_b64":"A8mh0HbD3p9A+m7ndRw6njSHT26WOXFbk8aH0rtT5LLIFL6DGBTv01t+ggJzW1jT18kWx9ucRrqxR41oby2SDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d6ff70b26310769319176000879818abdafe4aa455887d16d932eced21b6f6f","last_reissued_at":"2026-05-18T01:03:24.804416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:24.804416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone paths in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Matteo Novaga, Pietro Majer","submitted_at":"2009-06-09T15:26:13Z","abstract_excerpt":"We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\\mathbb N$. These graphs appear as line graph of uniform hypergraphs with vertex set $\\mathbb N$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.1689","kind":"arxiv","version":4},"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":"0906.1689","created_at":"2026-05-18T01:03:24.804490+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.1689v4","created_at":"2026-05-18T01:03:24.804490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.1689","created_at":"2026-05-18T01:03:24.804490+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVX7OCZGGEDW","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVX7OCZGGEDWSMMR","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVX7OCZG","created_at":"2026-05-18T12:26:00.592388+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/LVX7OCZGGEDWSMMROYAAQ6MBRK","json":"https://pith.science/pith/LVX7OCZGGEDWSMMROYAAQ6MBRK.json","graph_json":"https://pith.science/api/pith-number/LVX7OCZGGEDWSMMROYAAQ6MBRK/graph.json","events_json":"https://pith.science/api/pith-number/LVX7OCZGGEDWSMMROYAAQ6MBRK/events.json","paper":"https://pith.science/paper/LVX7OCZG"},"agent_actions":{"view_html":"https://pith.science/pith/LVX7OCZGGEDWSMMROYAAQ6MBRK","download_json":"https://pith.science/pith/LVX7OCZGGEDWSMMROYAAQ6MBRK.json","view_paper":"https://pith.science/paper/LVX7OCZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.1689&json=true","fetch_graph":"https://pith.science/api/pith-number/LVX7OCZGGEDWSMMROYAAQ6MBRK/graph.json","fetch_events":"https://pith.science/api/pith-number/LVX7OCZGGEDWSMMROYAAQ6MBRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVX7OCZGGEDWSMMROYAAQ6MBRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVX7OCZGGEDWSMMROYAAQ6MBRK/action/storage_attestation","attest_author":"https://pith.science/pith/LVX7OCZGGEDWSMMROYAAQ6MBRK/action/author_attestation","sign_citation":"https://pith.science/pith/LVX7OCZGGEDWSMMROYAAQ6MBRK/action/citation_signature","submit_replication":"https://pith.science/pith/LVX7OCZGGEDWSMMROYAAQ6MBRK/action/replication_record"}},"created_at":"2026-05-18T01:03:24.804490+00:00","updated_at":"2026-05-18T01:03:24.804490+00:00"}