{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZOBJYSV22C4A2UDLFBYWVL4VOP","short_pith_number":"pith:ZOBJYSV2","schema_version":"1.0","canonical_sha256":"cb829c4abad0b80d506b28716aaf9573f89ab3c36ac93e9c4656e8d394a01957","source":{"kind":"arxiv","id":"1511.07310","version":1},"attestation_state":"computed","paper":{"title":"The arithmetical rank of the edge ideals of graphs with pairwise disjoint cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Antonio Macchia, Margherita Barile","submitted_at":"2015-11-23T16:56:13Z","abstract_excerpt":"We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes."},"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":"1511.07310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2015-11-23T16:56:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e8ba5a12213d25b035c76ba36e00c9617682eb9fd3e042849ad08b8d46876ec9","abstract_canon_sha256":"d4fe4a84a7ef9e558d73b063f2833bf4c805ba213cc31f90692db9d558086d0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.702445Z","signature_b64":"8Po1bKLgwSAdZEzm06MJeVzIpBDc7VRUtYKD99DPXZzgFsR2WRhahVOn+dW0DiWVJ+rsYXQUaLDtMtAP1NXRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb829c4abad0b80d506b28716aaf9573f89ab3c36ac93e9c4656e8d394a01957","last_reissued_at":"2026-05-18T01:26:11.701884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.701884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The arithmetical rank of the edge ideals of graphs with pairwise disjoint cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Antonio Macchia, Margherita Barile","submitted_at":"2015-11-23T16:56:13Z","abstract_excerpt":"We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07310","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":"1511.07310","created_at":"2026-05-18T01:26:11.701980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07310v1","created_at":"2026-05-18T01:26:11.701980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07310","created_at":"2026-05-18T01:26:11.701980+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOBJYSV22C4A","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOBJYSV22C4A2UDL","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOBJYSV2","created_at":"2026-05-18T12:29:52.810259+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/ZOBJYSV22C4A2UDLFBYWVL4VOP","json":"https://pith.science/pith/ZOBJYSV22C4A2UDLFBYWVL4VOP.json","graph_json":"https://pith.science/api/pith-number/ZOBJYSV22C4A2UDLFBYWVL4VOP/graph.json","events_json":"https://pith.science/api/pith-number/ZOBJYSV22C4A2UDLFBYWVL4VOP/events.json","paper":"https://pith.science/paper/ZOBJYSV2"},"agent_actions":{"view_html":"https://pith.science/pith/ZOBJYSV22C4A2UDLFBYWVL4VOP","download_json":"https://pith.science/pith/ZOBJYSV22C4A2UDLFBYWVL4VOP.json","view_paper":"https://pith.science/paper/ZOBJYSV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07310&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOBJYSV22C4A2UDLFBYWVL4VOP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOBJYSV22C4A2UDLFBYWVL4VOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOBJYSV22C4A2UDLFBYWVL4VOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOBJYSV22C4A2UDLFBYWVL4VOP/action/storage_attestation","attest_author":"https://pith.science/pith/ZOBJYSV22C4A2UDLFBYWVL4VOP/action/author_attestation","sign_citation":"https://pith.science/pith/ZOBJYSV22C4A2UDLFBYWVL4VOP/action/citation_signature","submit_replication":"https://pith.science/pith/ZOBJYSV22C4A2UDLFBYWVL4VOP/action/replication_record"}},"created_at":"2026-05-18T01:26:11.701980+00:00","updated_at":"2026-05-18T01:26:11.701980+00:00"}